Sciweavers

217 search results - page 21 / 44
» A Logic for Approximate First-Order Reasoning
Sort
View
LPNMR
2005
Springer
14 years 1 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 8 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
AAAI
2007
13 years 9 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
First steps in the logic-based assessment of post-composed phenotypic descriptions
In this paper we present a preliminary logic-based evaluation of the integration of post-composed phenotypic descriptions with domain ontologies. The evaluation has been performed ...
Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau,...
DEXA
2010
Springer
180views Database» more  DEXA 2010»
13 years 8 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...