Sciweavers

377 search results - page 20 / 76
» Modular logic metaprogramming
Sort
View
BIRTHDAY
2006
Springer
13 years 11 months ago
Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
Arnon Avron, Anna Zamansky
ISMVL
2007
IEEE
91views Hardware» more  ISMVL 2007»
14 years 1 months ago
Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
Arnon Avron, Anna Zamansky
DLOG
2008
13 years 9 months ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
CADE
2008
Springer
14 years 7 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
Hasan Amjad, Richard Bornat
ECAI
1998
Springer
13 years 11 months ago
Causal Logic
This paper proposes a logic for causal based on event trees. Event trees provide a natural and familiar framework for probability and decision theory, but they lack the modularity...
Glenn Shafer