903 search results - page 11 / 181 » Completeness Results for Memory Logics |
DALT
2005
Springer
14 years 1 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
DATE
2002
IEEE
14 years 13 days ago
2002
IEEE
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
APAL
2005
13 years 7 months ago
2005
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
AIIA
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...