4513 search results - page 131 / 903 » Logic programming with satisfiability |
129
click to vote
PRICAI
2000
Springer
15 years 7 months ago
2000
Springer
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
137
click to vote
PPDP
1999
Springer
15 years 7 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
111
click to vote
ICLP
1998
Springer
15 years 7 months ago
1998
Springer
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
110
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
133
click to vote
AAAI
2004
15 years 4 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...