899 search results - page 49 / 180 » A CTL-Based Logic for Program Abstractions |
115
click to vote
LPNMR
2009
Springer
15 years 8 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...
117
click to vote
FOIKS
2004
Springer
15 years 7 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...
119
click to vote
LPNMR
2009
Springer
15 years 8 months 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...
103
Voted
CP
1998
Springer
15 years 6 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...
CORR
2006
Springer
15 years 2 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...