5506 search results - page 5 / 1102 » Minimal Logic Programs |
NMR
2004
Springer
14 years 1 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
CPAIOR
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
ENTCS
2006
13 years 7 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
AAAI
2000
13 years 9 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...