Treffer: Representing defaults and negative information without negation-as-failure
Title:
Representing defaults and negative information without negation-as-failure
Authors:
Source:
Logic for programming, artificial intelligence, and reasoning (13th International conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006)0LPAR 2006. :437-451
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 28 ref 1
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, Intelligence artificielle, Artificial intelligence, Calcul ensembliste, Set computation, Calcúlo conjunto, Circonscription, Circumscription, Circonscripción, Défaillance, Failures, Fallo, Inférence, Inference, Inferencia, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Langage déclaratif, Declarative language, Lenguaje declarativo, Mécanisme inférentiel, Inference mechanisms, Programmation logique, Logical programming, Programación lógica, Représentation connaissance, Knowledge representation, Representación conocimientos, Rupture, Ruptura, Sémantique, Semantics, Semántica, Programmation par ensemble reponse, Answer set programming, Programación conjunto respuesta
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Engineering Universidad Nacional del Sur Av. Alem 1253, 8000 Bahía Blanca, Argentina
ISSN:
0302-9743
Rights:
Copyright 2007 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
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.19131397
Database:
PASCAL Archive
Weitere Informationen
In logic programs, negation-as-failure has been used both for representing negative information and for providing default nonmonotonic inference. In this paper we argue that this twofold role is not only unnecessary for the expressiveness of the language, but it also plays against declarative programming, especially if further negation symbols such as strong negation are also available. We therefore propose a new logic programming approach in which negation and default inference are independent, orthogonal concepts. Semantical characterization of this approach is given in the style of answer sets, but other approaches are also possible. Finally, we compare them with the semantics for logic programs with two kinds of negation.