Sciweavers

3047 search results - page 47 / 610
» On the Meaning of Logical Completeness
Sort
View
APAL
2005
115views more  APAL 2005»
13 years 8 months ago
Completeness of S4 with respect to the real line: revisited
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
Guram Bezhanishvili, Mai Gehrke
TCS
2008
13 years 8 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum
AIML
2006
13 years 10 months ago
Isomorphism via translation
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 ...
Tadeusz Litak
DLOG
2001
13 years 10 months ago
Description of the RACER System and its Applications
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized ...
Volker Haarslev, Ralf Möller
AMAI
2006
Springer
13 years 8 months ago
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach
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...
Miroslaw Truszczynski