827 search results - page 59 / 166 » Proof-Theoretic Soundness and Completeness |
IJCAI
1989
13 years 11 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
AML
2010
13 years 10 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
AML
2006
13 years 10 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
JAIR
2008
13 years 10 months ago
2008
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
JFP
2006
13 years 10 months ago
2006
A part of a query that will never contribute data to the query answer should be regarded as an error. This principle has been recently accepted into mainstream XML query languages...