Sciweavers

AAAI
2000
13 years 5 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
AAAI
2000
13 years 5 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary
ICLP
2010
Springer
13 years 7 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto
ICLP
2003
Springer
13 years 8 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski