95 search results - page 3 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
IJCAI
1997
13 years 10 months ago
1997
We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is th...
SFP
2001
13 years 10 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
MST
2008
13 years 8 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
BIRTHDAY
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
ENTCS
2007
13 years 8 months ago
2007
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...