A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Deciding Full Branching Time Logic by Program Transformation
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. ...
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL * ) properties of finite state reactive systems. ...
Introduction The branching time temporal logic CTL * is among the most popular temporal logics that have been proposed for verifying properties of reactive systems [4] . ...
doi:10.1007/978-3-642-12592-8_2
fatcat:h7eohs2mq5aung4gotwvz3moli
Page 4811 of Mathematical Reviews Vol. , Issue 86j
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The equivalence checking is carried out by expanding step by step a comparison tree by “branching” or “skipping” as in the previous papers. ...
Martti Penttonen (Turku)
Steinby, Magnus (SF-TURK) 86j:68072 Some decidable properties of L-rational and L-algebraic tree transformations. ...
Page 4351 of Mathematical Reviews Vol. , Issue 96g
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We propose meaning-preserving translations between Lz, Ly and Ly (three modal logics in full agreement with branch- ing bisimulation), thus proving that they all have the same expres- sivity. ...
The technique we developed to cope with this is an adaptation in a branching-time framework of the methods un- derlying D. ...
A polyvariant binding-time analysis for off-line partial deduction
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction system as a Prolog program. ...
Using abstract interpretation, we collect information about the run-time behaviour of the program. ...
Leuschel are supported by the Fund for Scientific Research -Flanders Belgium (FWO). K. Sagonas is supported by the Research Council of the K.U. Leuven. ...
doi:10.1007/bfb0053561
fatcat:gta2kqtlgbc37ixmgac3xjrbm4
Formalization as the Immanent Part of Logical Solving
2018
Logical Investigations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The work is devoted to the logical analysis of the problem solving by logical means. ...
The precise solving of a precisely stated logical problem occupies only one third of the whole process of solving real problems by logical means. ...
Disjunction ∨ can be interpreted classically if elementary properties are decidable. Implication is treated constructively as existence of a program. Nilpotent logic is linear time decidable. ...
doi:10.21146/2074-1472-2018-24-1-129-145
fatcat:ifgxfvssgze5zoibim7sruqnxi
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
[article]
2000
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction system as a Prolog program. ...
Using abstract interpretation, we collect information about the run-time behaviour of the program. ...
Leuschel are supported by the Fund for Scientific Research -Flanders Belgium (FWO). K. Sagonas is supported by the Research Council of the K.U. Leuven. ...
arXiv:cs/0003068v1
fatcat:cr5uj746qrdoffxovxabo22j7q
Strong equivalence of reversible circuits is coNP-complete
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. ...
The complexity of deciding strong equivalence, including the ancilla bits, is less obvious and may depend on gate set. ...
By composing the triples (i, 1, β) and (i, α, 1) one then obtains an arbitrary triple (i, α, β). By simulating the full sequence of l such triples, one simulates the full branching program. ...
arXiv:1307.0836v1
fatcat:kmosvonfo5d7ph23vxsj44k5je
Page 8286 of Mathematical Reviews Vol. , Issue 2001K
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
For example, it follows that sat- isfiability for the full branching time logic CTL* can be tested in deterministic double exponential time. ...
Allen (1-TX-C; Austin, TX);
Jutla, Charanjit S. (1-IBM; Yorktown Heights, NY)
The complexity of tree automata and logics of programs. (English summary)
SIAM J. ...
Temporal stratification tests for linear and branching-time deductive databases
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The second algorithm applies to branching-time temporal deductive databases (which include as a special case the linear-time ones). ...
We demonstrate that for the temporal deductive databases we consider, temporal stratification coincides with local stratification in certain important cases in which the latter is polynomial-time decidable ...
Now, by applying the proposed algorithm one can easily see that the above (second) program is a locally stratified one. We do not give the full transformation since it results to 13 clauses. ...
doi:10.1016/j.tcs.2005.05.014
fatcat:c4ggsqvoqrdxbe3hk2uogjr4ge
Technical systems in logic: questions of formalization and automatic verification
2013
Logical Investigations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The questions of formalization in temporal logic and automatic analysis via computational tree transformations are discussed. ...
In the paper technical systems with counters are considered as logical models. ...
But the sense of temporal logics isn't restricted by only automata or program systems: they can describe any lasting-in-time process, every moment of which can be described by the classical logic. ...
doi:10.21146/2074-1472-2013-19-0-148-165
fatcat:g437f7kf3fcuvok67xmfmvgoea
The applicability of logic program analysis and transformation to theorem proving
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Analysis and transformation techniques developed for logic programming can be successfully applied to automatic theorem proving. ...
The specialisation techniques developed in this paper are independent of the proof system and can therefore be applied to theorem provers for any logic written as logic programs. 2 ...
Our analysis method depends heavily on techniques developed to analyse and transform logic programs. ...
doi:10.1007/3-540-58156-1_15
fatcat:hxxcgtriynbjboqlxl3oq3vt34
A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Interval temporal logics are quite expressive temporal logics, which turn out to be difficult to deal with in many respects. ...
We focus our attention on the logic of Allen's relation meets, a.k.a. Right Propositional Neighborhood Logic (RPNL), interpreted over finite linear orders. ...
Acknowledgments The authors acknowledge the support from the Spanish fellowship program ...
doi:10.1007/978-3-642-40537-2_8
fatcat:vgqnpnuserea7nxktixedvcehi
Real-time and Probabilistic Temporal Logics: An Overview
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We extrapolate the notions of decidability, axiomatizability, expressiveness, model checking, etc. for each logic analysed. We also provide a comparison of features of the temporal logics discussed. ...
In this paper we analyse real-time and probabilistic temporal logics which have been widely used in this field. ...
This work was partially supported by EPSRC research project EP/F033567. ...
arXiv:1005.3200v3
fatcat:xhrrcy26bzeehg7wqvjfikm26e
Computing non-ground representations of stable models
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
As a practical consequence, the well-founded model (or the set of stable models) may be partially pre-computed at compile-time, resulting in the association of each predicate symbol in the program to a ...
In partiuclar, a referee pointed out that related work on computing non-ground well-founded semantics has been done by C. Damásio in his PhD thesis (1996, unpublished). ...
Full Ground Compilation Storage Classical CNG Stable Mod. NG-Stable Mod. Full Ground Requirements Run-Time Query Full Ground NG-Stable Mod. CNG Stable Mod. Classical Execution Table 1. ...
doi:10.1007/3-540-63255-7_14
fatcat:w5ga3kgprrfv7g6l22d5prgztq
Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This research was supported by Core Research for Evolutional Science and Technology (CREST) Program "New High-performance Information Processing Technology Supporting Information-oriented Society" of Japan ...
This research was also partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research on Priority Areas, 16016211, 2004. ...
CTL is a kind of branching-time temporal logic that has been well studied and widely used especially for model checking. ...
doi:10.1007/978-3-540-69149-5_57
fatcat:hadfulpoaba4heq3bhfzgcqeou
« Previous
Showing results 1 — 15 out of 70,517 results