899 search results - page 21 / 180 » A CTL-Based Logic for Program Abstractions |
LANMR
2007
13 years 8 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
ICLP
2005
Springer
14 years 27 days ago
2005
Springer
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
FMCO
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
RR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We illustrate the potential of conditional hedge transformations in Web-related applications on the example of PρLog: an extension of logic programming with advanced rul...