4513 search results - page 79 / 903 » Logic programming with satisfiability |
116
Voted
ALP
1994
Springer
15 years 5 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
AIML
2004
15 years 3 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
105
click to vote
OWLED
2007
15 years 3 months ago
2007
The use of background knowledge and the adoption of Horn clausal logic as a knowledge representation and reasoning framework are the distinguishing features of Inductive Logic Prog...
110
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
EPIA
1995
Springer
15 years 5 months ago
1995
Springer
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...