Stable models and circumscription

TL;DR: The motivation and key concepts behind answer set programming---a promising approach to declarative problem solving.

TL;DR: This monograph presents and discusses fundamental concepts, different repair semantics, algorithms for computing consistent answers to queries, and also complexity-theoretic results related to the computation of repairs and doing consistent query answering.

TL;DR: This paper proposes a rule-based methodology for designing and combining abstract domains in abstract interpretation, enabling rapid prototyping of new domains for logic program analysis, with applications in proving complex program properties and approximating different properties.

TL;DR: This work proposes a new action language called BC+, which closes the gap between action languages and the modern Answer Set Programming (ASP) language, and is implemented by extending system CPLUS2ASP.

TL;DR: The topics in LNAI include automated reasoning, automated programming, algorithms, knowledge representation, agent-based systems, intelligent systems, expert systems, machine learning, natural-language processing, machine vision, robotics, search systems, knowledge discovery, data mining, and related programming languages.

TL;DR: This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.

TL;DR: This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.

TL;DR: It is shown that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available.