903 search results - page 82 / 181 » Completeness Results for Memory Logics |
161
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
158
click to vote
JAR
2008
15 years 6 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
157
click to vote
ICANNGA
2009
Springer
16 years 28 days ago
2009
Springer
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
164
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
196
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...