662 search results - page 14 / 133 » Logic Programming with Ordered Disjunction |
124
Voted
LPNMR
1999
Springer
15 years 8 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
130
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
110
Voted
CP
2007
Springer
15 years 10 months ago
2007
Springer
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
150
Voted
KR
2004
Springer
15 years 9 months ago
2004
Springer
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
164
Voted
JAR
2006
15 years 3 months ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...