1445 search results - page 97 / 289 » Abstract Interpretation of Logic Programs |
164
click to vote
PPDP
2009
Springer
16 years 18 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
152
click to vote
LPNMR
2009
Springer
16 years 18 days 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...
163
click to vote
FOIKS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
167
click to vote
LPNMR
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
142
click to vote
CP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...