Sciweavers

40 search results - page 5 / 8
» Nonmonotonic Reasoning with Well Founded Semantics
Sort
View
DLOG
2007
13 years 10 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...
AMAI
2007
Springer
13 years 7 months ago
Partial equilibrium logic
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...
Pedro Cabalar, Sergei P. Odintsov, David Pearce, A...
ESWS
2006
Springer
13 years 11 months ago
Rules with Contextually Scoped Negation
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
Axel Polleres, Cristina Feier, Andreas Harth
WLP
2007
Springer
14 years 1 months ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...
AAAI
2000
13 years 9 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski