1391 search results - page 75 / 279 » Completeness of Neighbourhood Logic |
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
LPAR
2012
Springer
12 years 4 months ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
CADE
1997
Springer
14 years 21 days ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
FSEN
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
ICDT
2007
ACM
14 years 3 months ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...