Sciweavers

846 search results - page 24 / 170
» Rewrite-Based Decision Procedures
Sort
View
IPL
2006
109views more  IPL 2006»
13 years 9 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
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...
Aaron Stump, Bernd Löchner
POPL
2011
ACM
13 years 21 days ago
Making prophecies with decision predicates
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...
Byron Cook, Eric Koskinen
LFCS
2009
Springer
14 years 4 months ago
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
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...
Uwe Keller, Stijn Heymans
FROCOS
2000
Springer
14 years 1 months ago
Combining Equational Theories Sharing Non-Collapse-Free Constructors
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 ...
Franz Baader, Cesare Tinelli
LICS
2012
IEEE
12 years 8 days ago
Countermodels from Sequent Calculi in Multi-Modal Logics
—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...
Deepak Garg, Valerio Genovese, Sara Negri