Sciweavers

124 search results - page 14 / 25
» Automata can show PSpace results for description logics
Sort
View
DEXAW
2007
IEEE
160views Database» more  DEXAW 2007»
14 years 2 months ago
RDF and Logic: Reasoning and Extension
In this paper we explore embeddings of the various kinds of RDF entailment in F-Logic. We show that the embeddings of simple, RDF, and RDFS entailment, as well as a large fragment...
Jos de Bruijn, Stijn Heymans
SIPS
2006
IEEE
14 years 1 months ago
Molecular quantum-dot cellular automata
: Molecular electronics is commonly conceived as reproducing diode or transistor action at the molecular level. The quantum-dot cellular automata (QCA) approach offers an attractiv...
Craig S. Lent
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 7 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 9 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
JLP
2000
140views more  JLP 2000»
13 years 7 months ago
An abductive event calculus planner
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan