Result: Simplifying logic programs under answer set semantics

Title:
Simplifying logic programs under answer set semantics
Authors:
PEARCE, David
Source:
Logic programming (Saint Malo, 6-10 September 2004)Lecture notes in computer science. :210-224
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 38 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Complexité programme, Program complexity, Complejidad programa, Programmation logique, Logical programming, Programación lógica, Représentation connaissances, Knowledge representation, Representación conocimientos, Règle inférence, Inference rule, Regla inferencia, Résolution problème, Problem solving, Resolución problema, Sémantique, Semantics, Semántica, Transformation programme, Program transformation, Transformación programa
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Informatics, Statistics and Telematics, Universidad Rey Juan Carlos, Madrid, Spain
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16126408
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16126408
Database:
PASCAL Archive

Further Information

Now that answer set programming has emerged as a practical tool for knowledge representation and declarative problem solving there has recently been a revival of interest in transformation rules that allow for programs to be simplified and perhaps even reduced to programs of 'lower' complexity. Although it has been known for some that there is a maximal monotonic logic, denoted by Ns, with the property that its valid (equivalence preserving) inference rules provide valid transformations of programs under answer set semantics, with few exceptions this fact has not really been exploited in the literature. The paper studies some new transformation rules using N5-inference to simplify extended disjunctive logic programs known to be strongly equivalent to programs with nested expressions.