Treffer: Probabilistic description logic programs

Title:
Probabilistic description logic programs
Authors:
LUKASIEWICZ, Thomas
Source:
Eighth European conference on symbolic and quantitative approaches to reasoning with uncertainty (ECSQARU 2005)International journal of approximate reasoning. 45(2):288-307
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 46 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, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Reconnaissance et synthèse de la parole et du son. Linguistique, Speech and sound recognition and synthesis. Linguistics, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Circonscription, Circumscription, Circonscripción, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Interrogation base donnée, Database query, Interrogación base datos, Logique description, Description logic, Lógica descripción, Logique probabiliste, Probabilistic logic, Modélisation, Modeling, Modelización, Méthode raffinement, Refinement method, Método afinamiento, Optimisation programme, Program optimization, Optimización programa, Programmation linéaire, Linear programming, Programación lineal, Programmation logique, Logical programming, Programación lógica, Programmation mathématique, Mathematical programming, Programación matemática, Représentation connaissance, Knowledge representation, Representación conocimientos, Sémantique, Semantics, Semántica, Traitement requête, Query processing, Tratamiento pregunta, Web sémantique, Semantic web, Web semántica, Programmation par ensemble reponse, Answer set programming, Programación conjunto respuesta, Answer set semantics, Independent choice logic, Normal program, Probabilistic uncertainty, Stratified program, Well-founded semantics
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma La sapienza, Via Salaria 113, 00198 Rome, Italy
ISSN:
0888-613X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18923639
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.18923639
Database:
PASCAL Archive

Weitere Informationen

Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole's independent choice logic. We show that query processing in such pdl-programs can be reduced to computing all answer sets of dl-programs and solving linear optimization problems, and to computing the well-founded model of dl-programs, respectively. Moreover, we show that the answer set semantics of pdl-programs is a refinement of the well-founded semantics of pdl-programs. Furthermore, we also present an algorithm for query processing in the special case of stratified pdl-programs, which is based on a reduction to computing the canonical model of stratified dl-programs.