903 search results - page 12 / 181 » Completeness Results for Memory Logics |
CG
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
IGPL
2008
13 years 7 months ago
2008
This paper is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the fundaments are laid for later res...
AIML
2006
13 years 8 months ago
2006
We observe that the known fact that the difference logic and the hybrid logic with universal modality have the same expressive power on Kripke frames can be strengthened for a far ...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
ENTCS
2007
13 years 7 months ago
2007
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...