Sciweavers

4513 search results - page 110 / 903
» Logic programming with satisfiability
Sort
View
APIN
1999
110views more  APIN 1999»
15 years 3 months ago
The Connectionist Inductive Learning and Logic Programming System
The Connectionist Inductive Learning and Logic Programming System, C-IL 2 P, integrates the symbolic and connectionist paradigms of Artificial Intelligence through neural networks...
Artur S. d'Avila Garcez, Gerson Zaverucha
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
15 years 8 months ago
Behavioral Extensions of Institutions
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
Andrei Popescu, Grigore Rosu
DLOG
2010
15 years 1 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...
139
Voted
DLOG
2007
15 years 5 months ago
Exploiting Conjunctive Queries in Description Logic Programs
We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics kno...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
COMMA
2008
15 years 4 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...