Sciweavers

448 search results - page 63 / 90
» Answer Set Programming: A Primer
Sort
View
AAAI
2004
14 years 11 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
JELIA
2010
Springer
14 years 8 months ago
The mcs-ie System for Explaining Inconsistency in Multi-Context Systems
The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via...
Markus Bögl, Thomas Eiter, Michael Fink, Pete...
CSL
2007
Springer
15 years 3 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
PPDP
2010
Springer
14 years 7 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
ASP
2003
Springer
15 years 2 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...