Sciweavers

1071 search results - page 155 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
WISE
2005
Springer
15 years 3 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
ICLP
2009
Springer
15 years 10 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 6 days ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
ML
2006
ACM
143views Machine Learning» more  ML 2006»
14 years 9 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton
AAAI
2008
15 years 3 days ago
Prime Implicate Normal Form for ALC Concepts
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
Meghyn Bienvenu