Sciweavers

181 search results - page 18 / 37
» On the Completeness of Propositional Hoare Logic
Sort
View
AML
2010
96views more  AML 2010»
14 years 9 months ago
Implicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
Petr Cintula, Carles Noguera
JAR
2006
101views more  JAR 2006»
14 years 9 months ago
Checking Consistency and Completeness of On-Line Product Manuals
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
Carsten Sinz, Wolfgang Küchlin, Dieter Feicht...
CADE
2008
Springer
15 years 10 months ago
Bit Inference
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
Nachum Dershowitz
POPL
2006
ACM
15 years 10 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
AAAI
1996
14 years 11 months ago
First-Order Conditional Logic Revisited
Conditional logics play an important role in recent attempts to investigate default reasoning. This paper investigates firstorder conditional logic. We show that, as for first-ord...
Nir Friedman, Joseph Y. Halpern, Daphne Koller