60 search results - page 10 / 12 » No complete linear term rewriting system for propositional l... |
PODS
2000
ACM
13 years 11 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
IGPL
2002
13 years 7 months ago
2002
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
IJCAI
2007
13 years 9 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
ICLP
2005
Springer
14 years 29 days ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...