827 search results - page 55 / 166 » Proof-Theoretic Soundness and Completeness |
DLOG
2009
13 years 5 months ago
2009
Context-sensitivity has been for long a subject of study in linguistics, logic and computer science. Recently the problem of representing and reasoning with contextual knowledge ha...
ER
2007
Springer
14 years 1 months ago
2007
Springer
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
FROCOS
2000
Springer
13 years 11 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
d Abstract) Dario Colazzo1 , Giorgio Ghelli2 , Paolo Manghi2 , and Carlo Sartiani2 1 LRI - Universit?e Paris Sud 2 Dipartimento di Informatica - Universit`a di Pisa If a subexpress...