Sciweavers

634 search results - page 22 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
TPHOL
2009
IEEE
14 years 4 months ago
Extended First-Order Logic
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
Chad E. Brown, Gert Smolka
CONCUR
2005
Springer
14 years 3 months ago
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
Sibylle B. Fröschle, Slawomir Lasota
JSAI
2007
Springer
14 years 3 months ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue
CLIMA
2007
13 years 11 months ago
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
Rajeev Goré, Linh Anh Nguyen
ENTCS
2007
158views more  ENTCS 2007»
13 years 9 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer