[图书][B] Term rewriting and all that
This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader
and Nipkow cover all the basic material--abstract reduction systems, termination …
and Nipkow cover all the basic material--abstract reduction systems, termination …
Shostak's congruence closure as completion
D Kapur - International Conference on Rewriting Techniques and …, 1997 - Springer
Shostak's congruence closure algorithm is demystified, using the framework of ground
completion on (possibly nonterminating, non-reduced) rewrite rules. In particular, the …
completion on (possibly nonterminating, non-reduced) rewrite rules. In particular, the …
Abstract congruence closure
L Bachmair, A Tiwari, L Vigneron - Journal of Automated Reasoning, 2003 - Springer
We describe the concept of an abstract congruence closure and provide equational
inference rules for its construction. The length of any maximal derivation using these …
inference rules for its construction. The length of any maximal derivation using these …
Multi‐agent Only Knowing
JY Halpern, G Lakemeyer - Journal of Logic and Computation, 2001 - ieeexplore.ieee.org
Levesque introduced a notion of 'only knowing', with the goal of capturing certain types of
non‐monotonic reasoning. Levesque's logic dealt with only the case of a single agent …
non‐monotonic reasoning. Levesque's logic dealt with only the case of a single agent …
On deciding satisfiability by theorem proving with speculative inferences
Applications in software verification often require determining the satisfiability of first-order
formulae with respect to background theories. During development, conjectures are usually …
formulae with respect to background theories. During development, conjectures are usually …
On theorem proving for program checking: historical perspective and recent developments
MP Bonacina - Proceedings of the 12th international ACM SIGPLAN …, 2010 - dl.acm.org
This article is a survey of recent results, related works and new challenges in automated
theorem proving for program checking. The aim is to give some historical perspective, albeit …
theorem proving for program checking. The aim is to give some historical perspective, albeit …
Abstract congruence closure and specializations
L Bachmair, A Tiwari - International Conference on Automated Deduction, 2000 - Springer
We use the uniform framework of abstract congruence closure to study the congruence
closure algorithms described by Nelson and Oppen [9], Downey, Sethi and Tarjan [7], and …
closure algorithms described by Nelson and Oppen [9], Downey, Sethi and Tarjan [7], and …
On deciding satisfiability by DPLL () and unsound theorem proving
Applications in software verification often require determining the satisfiability of first-order
formulæ with respect to some background theories. During development, conjectures are …
formulæ with respect to some background theories. During development, conjectures are …
Deciding the word problem for ground identities with commutative and extensional symbols
The word problem for a finite set of ground identities is known to be decidable in polynomial
time, and this is also the case if some of the function symbols are assumed to be …
time, and this is also the case if some of the function symbols are assumed to be …
Evolution of combinatorial and sequential online self-diagnosing hardware
M Garvie, A Thompson - NASA/DoD Conference on Evolvable …, 2003 - ieeexplore.ieee.org
Evolution of combinatorial and sequential online self-diagnosing hardware Page 1 Evolution
of Combinatonial and Sequential On-Line Self-Diagnosing Hardware Miguel Garvie and …
of Combinatonial and Sequential On-Line Self-Diagnosing Hardware Miguel Garvie and …