Treffer: Macros, macro calls and use of ensembles in modular answer set programming

Title:
Macros, macro calls and use of ensembles in modular answer set programming
Authors:
BARAL, Chitta, DZIFCAK, Juraj, TAKAHASHI, Hiro
Source:
Logic programming (22nd international conference, ICLP 2006)0ICLP 2006. :376-390
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 1 p.1/4 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, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Intelligence artificielle, Artificial intelligence, Circonscription, Circumscription, Circonscripción, Module programme, Program module, Módulo programa, Programmation logique, Logical programming, Programación lógica, Programmation modulaire, Modular programming, Programación modular, Représentation connaissance, Knowledge representation, Representación conocimientos, 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 Arizona State University, Tempe, AZ 85287, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19104714
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
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19104714
Database:
PASCAL Archive

Weitere Informationen

Currently, most knowledge representation using logic programming with answer set semantics (AnsProlog) is 'flat'. In this paper we elaborate on our thoughts about a modular structure for knowledge representation and declarative problem solving formalism using AnsProlog. We present language constructs that allow defining of modules and calling of such modules from programs. This allows one to write large knowledge bases or declarative problem solving programs by reusing existing modules instead of writing everything from scratch. We report on an implementation that allows such constructs. Our ultimate aim is to facilitate the creation and use of a repository of modules that can be used by knowledge engineers without having to re-implement basic knowledge representation concepts from scratch.