Sciweavers

248 search results - page 21 / 50
» Circuit-based Boolean Reasoning
Sort
View
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 2 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...
TOOLS
1999
IEEE
14 years 6 days ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee
TABLEAUX
2000
Springer
13 years 11 months ago
MSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
Ullrich Hustadt, Renate A. Schmidt
ISOLA
2010
Springer
13 years 5 months ago
Modeling and Reasoning about Service Behaviors and Their Compositions
Abstract. Service-oriented systems have recently emerged as context-independent component-based systems. Unlike components, services can be created, invoked, composed, and destroye...
Aida Causevic, Cristina Cerschi Seceleanu, Paul Pe...
CSL
2006
Springer
13 years 11 months ago
The Power of Linear Functions
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
Sandra Alves, Maribel Fernández, Már...