247 search results - page 35 / 50 » A Proof System and a Decision Procedure for Equality Logic |
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
EUSFLAT
2009
13 years 5 months ago
2009
The Spanish National Agency for Quality Assessment and Accreditation as part of its evaluation activities has established a procedure for evaluating both teaching and institutions,...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
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...