150 search results - page 14 / 30 » The Stable Models of a Predicate Logic Program |
199
click to vote
POPL
2005
ACM
16 years 2 hour ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
105
click to vote
LPNMR
2007
Springer
15 years 5 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 ...
JAIR
2006
14 years 11 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
IJCAI
2003
15 years 1 months ago
2003
We solve the problem of obtaining answers to queries posed to a mediated integration system un der the local-as-view paradigm that are consistent wrt to certain global integrity...
ICLP
2007
Springer
15 years 5 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...