Searching for "Logic Programming with Satisfiability" – sorted by Relevance.
-
Two-literal logic programs and satisfiability representation of stable models: A comparison
- Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison Guan
- Cited by 4 (2 self) – Add To MetaCart
-
Tight Logic Programs
- on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain
- Cited by 3 (1 self) – Add To MetaCart
-
Logic Program Synthesis
- get a logic program satisfying the specification? Logic programming provides a uniquely nice
- Cited by 36 (11 self) – Add To MetaCart
-
Expanding Queries to Incomplete Databases By Interpolating General Logic Programs.
- programs. We develop an algorithm that given a general logic program (satisfying certain syntactic
- Cited by 3 (3 self) – Add To MetaCart
-
Probabilistic Logic Programming under Maximum Entropy
- probabilistic logic program is satisfiable. Finally, and as a central contribution of this paper, we introduce
- Cited by 15 (5 self) – Add To MetaCart
-
T.: Incremental answer sets and their computation
- the ι-answer sets of a logic program that satisfy a given set of integrity constraints. Our algorithm
- Cited by 1 (1 self) – Add To MetaCart
-
Logical Constraints and Logic Programming
- constraints of the rules of the logic program are satisfied and hence which rules can fire at time n
- Cited by 5 (3 self) – Add To MetaCart
-
Meta-Reasoning in Executable Temporal Logic
- is decidable, i.e. if a US-logic program is satisfiable, then a model for the program can be found through
- Cited by 33 (13 self) – Add To MetaCart
-
Probabilistic Logic Programming
- of deciding whether a probabilistic logic program is satisfiable. While classical logic programs (sets
- Cited by 30 (11 self) – Add To MetaCart
-
The Prioritized Inductive Logic Programs1
- that the inductive logic programs satisfy the convergence. Given an inductive logic program A, if for every positive
- Add To MetaCart

