Sciweavers

3970 search results - page 538 / 794
» A Logic For Causal Reasoning
Sort
View
CAV
2009
Springer
163views Hardware» more  CAV 2009»
16 years 7 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
POPL
2007
ACM
16 years 7 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
FROCOS
2009
Springer
16 years 1 months ago
Putting ABox Updates into Action
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, upda...
Conrad Drescher, Hongkai Liu, Franz Baader, Steffe...
LICS
2008
IEEE
16 years 1 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
AIMSA
2008
Springer
16 years 1 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek