Sciweavers

3776 search results - page 399 / 756
» Partition-Based Logical Reasoning
Sort
View
ICLP
1994
Springer
15 years 9 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
KGC
1993
Springer
15 years 9 months ago
The Mathematics of Set Predicates in Prolog
We provide a logical speci cation of set predicates ndall and bagof of Prolog. The speci cation is given in proof theoretic terms, and pertains to any SLD resolution based language...
Egon Börger, Dean Rosenzweig
ATAL
2006
Springer
15 years 8 months ago
Automated semantic web service discovery with OWLS-MX
We present an approach to hybrid semantic Web service matching that complements logic based reasoning with approximate matching based on syntactic IR based similarity computations...
Matthias Klusch, Benedikt Fries, Katia P. Sycara
AAAI
2007
15 years 7 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
CADE
2010
Springer
15 years 6 months ago
Premise Selection in the Naproche System
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
Marcos Cramer, Peter Koepke, Daniel Kühlwein,...