2006/08/25 by V. W. Marek, Victor W. Marek, Ilkka Niemelä +6
Computer Science · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #D.1.6 #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0608103
33 pages
arxiv created 2006/08/25 · openalex publication_date 2006/08/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the generalization involves nondeterminism. Our main results demonstrate that our formalism is a common generalization of (1) normal logic programming with its semantics of models, supported models and stable models, (2) logic programming with weight atoms (lparse programs) with the semantics of stable models, as defined by Niemela, Simons and Soininen, and (3) of disjunctive logic programming with the possible-model semantics of Sakama and Inoue.