Sciweavers

Share
FROCOS
2007
Springer
9 years 13 days ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
FROCOS
2007
Springer
9 years 13 days ago
Combining Proof-Producing Decision Procedures
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tr...
FROCOS
2007
Springer
9 years 13 days ago
Languages Modulo Normalization
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Hitoshi Ohsaki, Hiroyuki Seki
FROCOS
2007
Springer
9 years 13 days ago
Combining Classical and Intuitionistic Implications
We present a simple logic that combines, in a conservative way, the implicative fragments of both classical and intuitionistic logics, thus settling a problem posed by Dov Gabbay i...
Carlos Caleiro, Jaime Ramos
FROCOS
2007
Springer
9 years 13 days ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
books