Sciweavers

254 search results - page 24 / 51
» Answer Sets for Propositional Theories
Sort
View
TABLEAUX
2005
Springer
15 years 3 months ago
Comparing Instance Generation Methods for Automated Reasoning
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
Swen Jacobs, Uwe Waldmann
ICLP
2003
Springer
15 years 2 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 2 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
87
Voted
ESWS
2006
Springer
15 years 1 months ago
Encoding Classifications into Lightweight Ontologies
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
Fausto Giunchiglia, Maurizio Marchese, Ilya Zaihra...
AAAI
2010
14 years 11 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou