846 search results - page 24 / 170 » Rewrite-Based Decision Procedures |
IPL
2006
14 years 9 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
111
click to vote
POPL
2011
ACM
14 years 11 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
74
Voted
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
98
Voted
FROCOS
2000
Springer
15 years 1 months ago
2000
Springer
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
208
click to vote
LICS
2012
IEEE
12 years 12 months ago
2012
IEEE
—A novel countermodel-producing decision procedure that applies to several multi-modal logics, both intuitionistic and classical, is presented. Based on backwards search in label...