725 search results - page 64 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
151
click to vote
AAAI
1994
15 years 7 months ago
1994
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
211
click to vote
LOGCOM
2010
15 years 24 days ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
177
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
147
click to vote
JAR
2000
15 years 5 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
158
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...