3776 search results - page 505 / 756 » Partition-Based Logical Reasoning |
FUIN
2007
13 years 8 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
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...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
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...
FROCOS
2009
Springer
14 years 2 months ago
2009
Springer
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...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
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...