36 search results - page 6 / 8 » ASSAT: computing answer sets of a logic program by SAT solve... |
LPNMR
2009
Springer
14 years 1 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
ASP
2001
Springer
13 years 11 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
ICLP
2003
Springer
14 years 4 days ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
AI
2010
Springer
13 years 7 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...