41 search results - page 6 / 9 » A Logic for Reasoning about Generic Judgments |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
KES
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. A mobile robot that interacts with its environment needs a machineunderstandable representation of objects and their usages. We present an ontology of objects, with gener...
TACAS
1999
Springer
13 years 11 months ago
1999
Springer
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...