Sciweavers

2148 search results - page 162 / 430
» From process logic to program logic
Sort
View
HYBRID
2010
Springer
15 years 4 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
CSUR
1999
137views more  CSUR 1999»
14 years 9 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
ICTAI
1996
IEEE
15 years 2 months ago
Forward-Tracking: A Technique for Searching Beyond Failure
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
Elena Marchiori, Massimo Marchiori, Joost N. Kok
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 10 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
ICLP
2009
Springer
15 years 10 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz