Sciweavers

1021 search results - page 17 / 205
» Concepts in Proof Planning
Sort
View
CL
2000
Springer
14 years 28 days ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
ACISICIS
2005
IEEE
13 years 10 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun
STACS
2010
Springer
14 years 3 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
Edward A. Hirsch, Dmitry Itsykson
CAV
2007
Springer
118views Hardware» more  CAV 2007»
14 years 2 months ago
Local Proofs for Global Safety Properties
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
Ariel Cohen 0002, Kedar S. Namjoshi
IPPS
2006
IEEE
14 years 2 months ago
Communication concept for adaptive intelligent run-time systems supporting distributed reconfigurable embedded systems
Reconfigurable computing systems have already shown their abilities to accelerate embedded hardware/ software systems. Since standard processor-based embedded applications have co...
M. Ullmann, J. Becker