Nested expressions in logic programs

Authors:
Vladimir Lifschitz;Lappoon R. Tang;Hudson Turner
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, USA;Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, USA;Department of Computer Science, University of Minnesota at Duluth, Duluth, MN 55812, USA
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
1999

Citing 6
Cited 88

Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
A logic of knowledge and justified assumptions

Artificial Intelligence
Minimal belief and negation as failure

Artificial Intelligence
Foundations of logic programming

Principles of knowledge representation
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Encoding Planning Problems in Nonmonotonic Logic Programs

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions

EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Fages' Theorem for Programs with Nested Expressions

Proceedings of the 17th International Conference on Logic Programming
Disjunctive Explanations

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Capturing Stationary and Regular Extensions with Reiter's Extensions

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Strong Equivalence for Logic Programs and Default Theories (Made Easy)

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Equivalence in Answer Set Programming

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Partial Models of Extended Generalized Logic Programs

CL '00 Proceedings of the First International Conference on Computational Logic
Computing Equilibrium Models Using Signed Formulas

CL '00 Proceedings of the First International Conference on Computational Logic
Inverse Entailment in Nonmonotonic Logic Programs

ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
A three-valued characterization for strong equivalence of logic programs

Eighteenth national conference on Artificial intelligence
Applications of intuitionistic logic in Answer Set Programming

Theory and Practice of Logic Programming
Tight logic programs

Theory and Practice of Logic Programming
Strong equivalence made easy: nested expressions and weight constraints

Theory and Practice of Logic Programming
Characterization of strongly equivalent logic programs in intermediate logics

Theory and Practice of Logic Programming
Weight constraints as nested expressions

Theory and Practice of Logic Programming
Why are there so many loop formulas?

ACM Transactions on Computational Logic (TOCL)
Loop formulas for circumscription

Artificial Intelligence
Answer Set Programming Based on Propositional Satisfiability

Journal of Automated Reasoning
Parametric connectives in Disjunctive Logic Programming

AI Communications
Semantical characterizations and complexity of equivalences in answer set programming

ACM Transactions on Computational Logic (TOCL)
Partial equilibrium logic

Annals of Mathematics and Artificial Intelligence
Updates in answer set programming: An approach based on basic structural properties

Theory and Practice of Logic Programming
Open answer set programming with guarded programs

ACM Transactions on Computational Logic (TOCL)
Semantic forgetting in answer set programming

Artificial Intelligence
Normal Form Nested Programs

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Versatile Semantic Modeling of Frame Logic Programs under Answer Set Semantics

ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Twelve Definitions of a Stable Model

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Probabilistic reasoning with answer sets

Theory and Practice of Logic Programming
On Negative Unfolding in the Answer Set Semantics

Logic-Based Program Synthesis and Transformation
Hyperequivalence of logic programs with respect to supported models

Annals of Mathematics and Artificial Intelligence
Logic Programs with Multiple Chances

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
SAT-based answer set programming

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Loop formulas for circumscription

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Forgetting and conflict resolving in disjunctive logic programming

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Revised Concept of Safety for General Answer Set Programs

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On Reductive Semantics of Aggregates in Answer Set Programming

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A logic program characterization of causal theories

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
From answer set logic programming to circumscription via logic of GK

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
On the equivalence between answer sets and models of completion for nested logic programs

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A model-theoretic counterpart of loop formulas

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Loop formulas for circumscription

Artificial Intelligence
Circumscriptive event calculus as answer set programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Normal Form Nested Programs

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
General default logic

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
General default logic

Annals of Mathematics and Artificial Intelligence
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Artificial Intelligence
Answer set programming

A 25-year perspective on logic programming
From answer set logic programming to circumscription via logic of GK

Artificial Intelligence
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
Formalising the Fisherman's Folly puzzle

Artificial Intelligence
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination

ACM Transactions on Computational Logic (TOCL)
Logic programs with propositional connectives and aggregates

ACM Transactions on Computational Logic (TOCL)
Thirteen definitions of a stable model

Fields of logic and computation
Exploring relations between answer set programs

Logic programming, knowledge representation, and nonmonotonic reasoning
Compact translations of non-disjunctive answer set programs to propositional clauses

Logic programming, knowledge representation, and nonmonotonic reasoning
ASP at work: spin-off and applications of the DLV system

Logic programming, knowledge representation, and nonmonotonic reasoning
On modular translations and strong equivalence

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Nested epistemic logic programs

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
On the logic and computation of partial equilibrium models

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Representing defaults and negative information without negation-as-failure

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Revision programs with explicit negation

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Reducing propositional theories in equilibrium logic to logic programs

EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Ordered completion for first-order logic programs on finite structures

Artificial Intelligence
Analysing and extending well-founded and partial stable semantics using partial equilibrium logic

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Deducing logic programs

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
On elementary loops of logic programs

Theory and Practice of Logic Programming
Computing weighted solutions in ASP: representation-based method vs. search-based method

Annals of Mathematics and Artificial Intelligence
Interpolable formulas in equilibrium logic and answer set programming

Journal of Artificial Intelligence Research
Conflict-driven answer set solving: From theory to practice

Artificial Intelligence
Nested Preferences in Answer Set Programming

Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Here and there among logics for logic programming

Correct Reasoning
Well-Supported semantics for logic programs with generalized rules

Correct Reasoning
Normal Form Nested Programs

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

Journal of Artificial Intelligence Research
Tableau Calculi for Logic Programs under Answer Set Semantics

ACM Transactions on Computational Logic (TOCL)
Eliminating nonmonotonic DL-Atoms in description logic programs

RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Action language BC: preliminary report

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Forgetting for answer set programs revisited

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Relating constraint answer set programming languages and algorithms

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the answer set semantics to a class of logic programs with nested expressions permitted in the bodies and heads of rules. These expressions are formed from literals using negation as failure, conjunction (,) and disjunction (;) that can be nested arbitrarily. Conditional expressions are introduced as abbreviations. The study of equivalent transformations of programs with nested expressions shows that any such program is equivalent to a set of disjunctive rules, possibly with negation as failure in the heads. The generalized answer set semantics is related to the Lloyd–Topor generalization of Clark’s completion and to the logic of minimal belief and negation as failure.