Sciweavers

884 search results - page 63 / 177
» The Linear Logic of Multisets
Sort
View
DBPL
2001
Springer
113views Database» more  DBPL 2001»
14 years 1 months ago
Model-Checking Based Data Retrieval
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
Agostino Dovier, Elisa Quintarelli
DLOG
2001
13 years 10 months ago
Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...
Volker Haarslev, Martina Timmann, Ralf Möller
NIPS
2001
13 years 10 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
LICS
2010
IEEE
13 years 7 months ago
The Undecidability of Boolean BI through Phase Semantics
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
Dominique Larchey-Wendling, Didier Galmiche
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 9 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari