A deductive solution for plan generation
New Generation Computing
Temporal logic of programs
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
How to clear a block: A theory of plans
Journal of Automated Reasoning
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Deductive planning and plan reuse in a command language environment
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
First-Order Dynamic Logic
A Discipline of Programming
A Dynamic Logic for Program Verification
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Plan Generation by Linear Proofs: On Semantics
GWAI '89 Proceedings of the 13th German Workshop on Artificial Intelligence
Tactical Theorem Proving in Program Verification
Proceedings of the 10th International Conference on Automated Deduction
A Semantics for Persistency in Propositional Dynamic Logic
CL '00 Proceedings of the First International Conference on Computational Logic
| Hi-index | 0.00 |
The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...