4513 search results - page 256 / 903 » Logic programming with satisfiability |
151
click to vote
APIN
2000
15 years 3 months ago
2000
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
134
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
122
click to vote
APAL
2006
15 years 4 months ago
2006
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
120
click to vote
KR
1998
Springer
15 years 8 months ago
1998
Springer
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the p...
137
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...