M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, Vol.18, pages 194-211, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Trust and Commitment in Dynamic Logic - Jan Broersen Mehdi (2002) (1 citation) (Correct)
....possible actions are to take one or two pennies at a time. Trust and commitments can be created by communication. Our logic therefore consists of a dynamic logic for actions and modal operators for trust and commitment. The dynamic logic is an extension of standard propositional dynamic logic [6, 7] that contains operators for choice, for iteration and ; for sequence. The formula ######### expresses that agent is able to perform action # and by doing so it possibly reaches a state where # holds. Our extension incorporates a concurrency operator and an action negation operator . ....
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194--211, September 1979.
2ATAs make DLs easy - Calvanese, De Giacomo, Lenzerini (2002) (2 citations) (Correct)
....services over knowledge bases (in particular for logical implication) We show how to decide satis ability of ALCFI reg concepts by reducing it to nonemptiness of 2ATAs. To this end we rst de ne the (syntactic) closure for ALCFI reg , which extends the standard Fischer Ladner for converse pdl [4], by treating functional restrictions as atomic concepts. For technical reasons we include in the closure also additional elements representing basic roles and their negations. In particular, the closure CLF (C 0 ) of an ALCFI reg concept C 0 is de ned as the smallest set No condition is ....
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and System Sciences, 18:194-211, 1979.
Efficient On-the-Fly Model-Checking for Regular.. - Mateescu, Sighireanu (2000) (4 citations) (Correct)
.... classes usually encountered (safety, liveness, fairness) Among the wide range of temporal logics proposed in the literature, the modal calculus [18] is particularly powerful, subsuming linear time logics as Ltl [22] branching time logics as Ctl [4] or Actl [25] and regular logics as Pdl [12] or Pdl # [27] Secondly, the underlying model checking problem should have a su#ciently low complexity, in order to o#er reasonable response times on practical applications. Optimizing this is often contradictory with the first criterion above, because the model checking complexity of temporal ....
....future work. 2 Regular alternation free calculus The logic that we propose, called regular alternation free calculus, is an extension of the alternation free fragment of the modal calculus [18,7] with action formulas as in Actl [25] and with regular expressions over action sequences as in Pdl [12]. It allows direct encodings of pure branching time logics like Actl or Ctl [4] as well as of regular logics like Pdl or Pdl # [27] We first define its syntax and semantics, and then we show its usefulness by means of several examples of commonly encountered temporal properties. 2.1 Syntax ....
M. J. Fischer and R. E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences, (18):194--211, 1979.
Normal Multimodal Logics With Interaction Axioms: A Tableau.. - Baldoni (2000) (3 citations) (Correct)
....of GLs but also the undecidability of the subclasses of GLs based on context sensitive and context free grammars. Moreover, it is shown that the subclass of GLs based on right regular grammars is decidable by means of the filtration methods, by defining an extension of the Fisher Ladner closure [26]. A careful study of the filtration method for the multimodal logics case is presented in [13] where the author shows some limits of its use. In this paper we do not mention about the number of multimodal operators to preserve and or destroy decidability for the presented classes of multimodal ....
M. J. Fischer and R. E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences, 18(2):194--211, 1979.
About Cut Elimination for Logics of Common - Alberucci, Jäger (Correct)
.... consistent with respect to # and contains #. Before formulating and proving the main results of this section, we have to fix those sets of L n (C) formulas which we have to substitute for # and## The so called Fischer Ladner closure FL(#) of an L n (C) formula # (see Fischer and Ladner [6]) is the set of L n (C) formulas which is inductively generated as follows: 12 1. # belongs to FL(#) 2. If # belongs to FL(#) then belongs to FL(#) #) belongs to FL(#) then # and # belong to FL(#) #) belongs to FL(#) then # and # belong to FL(#) 5. If K i (#) belongs to FL(#) ....
....FL(#) 6. If C(#) belongs to FL(#) then #, E(#) and E(C(#) belong to FL(#) Moreover, for any finite set # of L n (C) formulas, its Fisher Ladner closure FL(#) is introduced by FL(#) FL(# # ) The Fischer Ladner closure FL(#) of an L n (C) formula # is obviously finite and, according to [6], the number of elements of FL(#) is of order O( # ) where # denotes the length of the formula #. Sets FL(#) will take over the role of the set # in the previous considerations; the counterpart of the set# will be the disjunctive conjunctive closure DC(#) of FL(#) which is carefully ....
Michael J. Fischer and Richard E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences 18 (1979), 194--211.
Creating Collective Intention Through Dialogue - Frank Dignum Barbara (2000) (11 citations) (Correct)
....R1 From and , derive ; Modus ponens) R2 From , derive [do(i; Necessitation) The axiom system PDL is sound and complete with respect to Kripke models with the dynamic accessibility relations R i; as defined above. Its decision problem is exponential time complete, as proved by [17]. 2.4 Beliefs To represent beliefs, we adopt a standard KD45n system for n agents as explained in [16] where we take BEL(a; to have as intended meaning agent a believes proposition . KD45n consists of the following axioms and rules for i = 1; n : A2 BEL(i; BEL(i; ....
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs, Journal of Computer System Sci. 18, 1979, pp. 194-211.
Evidence-Based Verification - Tan (2002) (Correct)
....by the truth of 1 . 2. 3 The Modal Mu Calculus and Boolean Equation Systems The calculus is an extremely expressive temporal logic [27] It is as expressive as alternating automata on infinite trees, hence subsumes most known specification formalisms, including dynamic logics such as PDL [20] and temporal logics such as LTL and CTL # [16] We will introduce the calculus syntactically as a special instance of fixpoint equation systems. Translating between calculus equation systems and its most traditional linear format [27] is straightforward. Since we will use Boolean equation ....
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194--211, 1979.
Description Logics as Ontology Languages for the Semantic Web - Baader, Horrocks, Sattler (2003) (20 citations) (Correct)
....to design an algorithm that can decide satisfiability w.r.t. role hierarchies and transitive roles. This problem is known to be ExpTime complete [77] In fact, ExpTime hardness can be shown by an easy adaptation of the ExpTime hardness proof for satisfiability in propositional dynamic logic [38]. Using automata based techniques, Tobies [77] shows that satisfiability of w.r.t. role hierarchies is indeed decidable within exponential time. In the remainder of this section, we sketch a tableau based decision procedure for this problem. This procedure, which is described in more detail in ....
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Science, 18:194--211, 1979.
On Behavior of Interacting Agents - Dekhtyar, Dikovsky, Valiev (2002) (Correct)
....MA BEHAVIOR problem for nondeterministic ground, expanding and 2 agent systems is APSPACE hard and consequently, EXPTIME hard [7] 2)Lower bound. The proof is by a modification of the proof of theorem 2 (2) similar to that we have used immediately above. 3) The proof follows an argument in [21]. It is easily shown that using the usual binary coding of numbers, the size of descriptions of MA systems A(M;x) in (1) and (2) can be bounded by O(n log n) Then the required assertion is obtained by using an ATM M recognizing in space O(n) a set recognizable by a DTM in time 3 but not in ....
Fischer, M. J., Ladner, R. J. Propositional dynamic logic of regular programs. J. Comp. Sys. Sci., 8(1979), 194-211.
... Afmc - Kupferman, Vardi (Correct)
....The alternation free calculus (AFMC) consists of calculus formulas with no alternation between least and greatest fixpoint operators. Thus, AFMC is a natural closure of 1 [ 1 , which is contained in both 2 and 2 . AFMC subsumes the branching temporal logic CTL and the dynamic logic PDL [FL79]. Formulas of AFMC can be symbolically evaluated in time linear in the structure [CS91,KVW00] While designers may prefer to use higher level logics to specify properties, model checking tools often proceed by evaluating the corresponding AFMC formulas [BRS99] Finally, it is hard to produce an ....
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194--211, 1979.
Dynamic Logic - Harel, Kozen, Tiuryn (1984) (356 citations) (Correct)
.... relational algebraic approach taken here, in which programs are interpreted as binary input output relations, was introduced in the context of DL by [Pratt, 1976] The notions of partial and total correctness were present in the early work of [Hoare, 1969] Regular programs were introduced by [Fischer and Ladner, 1979] in the context of PDL. The concept of nondeterminism was introduced in the original paper of [Turing, 1936] although he did not develop the idea. Nondeterminism was further developed by [Rabin and Scott, 1959] in the context of finite automata. Burstall, 1974] suggested using modal logic for ....
....of [Pratt, 1976] prompted by a suggestion of R. Moore, that it was actually shown how to extend modal logic in a useful way by considering a separate modality for every program. The first research devoted to propositional reasoning about programs seems to be that of [Fischer and Ladner, 1977; Fischer and Ladner, 1979] on PDL. As mentioned in the Preface, the general use of logical systems for reasoning about programs was suggested by [Engeler, 1967] Other semantics besides Kripke semantics have been studied; see [Berman, 1979; Nishimura, 1979; Kozen, 1979b; Trnkova and Reiterman, 1980; Kozen, 1980b; Pratt, ....
[Article contains additional citation context not shown here]
Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194--211, 1979.
Deciding Regular Grammar Logics With Converse Through.. - Demri, de Nivelle (2003) (3 citations) (Correct)
....CPDL by replacing every occurrence of [i] by [c i ] every occurrence of [i] by [c i ] and every occurrence of [U ] by [ c 1 [ c n 1 [c 1 [ c n 1 ) One can show that is K [U ] satis able i the translated formula is CPDL satis able. The proof is standard (see e.g. [FL79,Tuo90,GP92]) Hence, by combining this result with Theorem 5, we obtain a logspace transformation from GSP(REG into CPDL. Some simpli cations can be made using for instance the obvious equivalences [U ] U ] U ] and ( Extensions with nominals is also ....
M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
Efficient Approximate Deduction and an Application to Computer.. - Massacci (1998) (Correct)
....temporal logics and dynamic logics have also found plenty of applications. One may see the work of Manna Pnueli [107] or the handbook by Moller Birtwistle [130] for the verification of concurrent systems,the review of McFarland [126] for hardware verification the original work of Fisher Landher [60] for reasoning about programs (see also the recent overview by Kozen Tiuryn [95] Dynamic logics has been used for computational linguistics by Blackburn Spaan [18] for conditional logic by Friedman halpern [65] and for knowledge representation languages by Schild [156] For instance, the ....
.... and knowledge with perfect introspection) whereas it is Ps CE complete for the modal logics between K and 4, a result which dates back to Ladher [98] Logical consequence is EXPTIMEcomplete for modal logics (see Halpern 8z Moses [82] and for dynamic logics (see the papers by Fischer 8z Ladher [60] or Pratt [146] We would like these facts to be reflected into efficient strategies for theorem proving: Question 1.7 Can we design simple restrictions on the strategies for the proof search, so that the worst case complexity of validity checking with those strategies will match the lower bound ....
[Article contains additional citation context not shown here]
N. Fischer and R. Ladner. Propositional dynamic logic of regular programs. J. of Computer and System Sciences, 18:194-211, 1979.
The Complexity of Enriched -Calculi - Piero Bonatti Carsten (Correct)
No context found.
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, Vol.18, pages 194-211, 1979.
Regular Vacuity - Doron Bustan Alon (Correct)
No context found.
M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. JCSS, 18:194-- 211, 1979.
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
No context found.
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194--211, 1979.
A System for the Static Analysis of XPath - Geneves, Layaida (2006) (Correct)
No context found.
Fischer, M. J. and Ladner, R. E. 1979. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18, 2, 194--211.
The Complexity of Enriched μ-Calculi - Bonatti, Lutz, Murano, Vardi (Correct)
No context found.
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, Vol.18, pages 194-211, 1979.
KAT-ML: An Interactive Theorem Prover for Kleene Algebra with .. - Aboul-Hosn, Kozen (Correct)
No context found.
Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194--211, 1979.
KAT-ML: An Interactive Theorem Prover for Kleene Algebra with .. - Aboul-Hosn, Kozen (Correct)
No context found.
Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18 (1979) 194--211
Model Checking Action- and State-Labelled Markov Chains - Baier, Cloth, Haverkort, al. (2004) (Correct)
No context found.
M. Fischer and R. Ladner, "Propositional dynamic logic of regular programs," J. Comput. Syst. Sci., vol. 8, pp. 194-- 211, 1979.
Branching Time and Partial Order - In Temporal Logics (Correct)
No context found.
M. J. Fischer, R. E. Ladner (1979): Propositional Dynamic Logic of Regular Programs. J. of Comp. Syst. Sci. 18(2), 194-211.
A Hierarchical Completeness Proof for Interval Temporal Logic.. - Moszkowski (2003) (1 citation) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194--211, Apr. 1979.
Characterizing EF and EX tree logics - Bojanczyk, Walukiewicz (2004) (Correct)
No context found.
M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194211, 1979.
Combining Dynamic Logic with Doxastic Modal Logics - Schmidt, Tishkovsky (2002) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194-211, 1979.
Relativized Action Complement for Dynamic Logics - Broersen (Correct)
No context found.
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194--211, 1979.
Trust and Commitment in Dynamic Logic - Jan Broersen Mehdi (2002) (1 citation) (Correct)
No context found.
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194--211, September 1979.
Implementation and Evaluation - Of Tableau Algorithm (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Science, 18:194-211, 1979.
Deciding Agent Logics - From KARO to WSnS - Hirsch (2001) (Correct)
No context found.
Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194 - 211, 1979. This is a revised version of the original paper published 1977.
Metric Semantics for Reactive Probabilistic Processes - Norman (1997) (7 citations) (Correct)
No context found.
M.J. Fischer and R.E. Ladner. Propositional Dynamic Logic of regular programs. Journal of Computer System Science, 18(2):194-211, 1979.
Interaction between Knowledge, Action and Commitment.. - Schmidt, Tishkovsky.. (2003) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
Optimizing Description Logic Subsumption - Horrocks, Patel-Schneider (1999) (18 citations) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18, 194--211, 1979.
Model Checking and Evidence Exploration - Dong, Ramakrishnan, Smolka (2003) (1 citation) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194--211, 1979.
Evolution of Collective Commitment during Teamwork - Dunin-Keplicz, Verbrugge (2003) (Correct)
No context found.
Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, 18(2), 1979, 194--211.
2ATAs make DLs easy - Calvanese, De Giacomo, Lenzerini (2002) (2 citations) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and System Sciences, 18:194-211, 1979.
On the Universal and Existential Fragments of the.. - Henzinger, Kupferman.. (Correct)
No context found.
M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194--211, 1979.
Basic Description Logics - Baader, Nutt (2003) (14 citations) (Correct)
No context found.
Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and System Sciences, 18:194-211, 1979.
Optimising Description Logic Subsumption - Horrocks, Patel-Schneider (1999) (28 citations) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194--211, 1979.
Satisfiability and Completeness of Converse-PDL Replayed - Lange (2003) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194--211, April 1979.
Reasoning on UML Class Diagrams - Daniela Berardi Andrea (2003) (5 citations) (Correct)
No context found.
Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and System Sciences, 18:194-211, 1979.
Symbolic Model Checking of Non-Regular Properties - Lange (2004) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194--211, April 1979.
What is an Inference Rule? - Fagin, Halpern, Vardi (1992) (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
Unknown - (Correct)
No context found.
M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194--211, 1979.
Decidable Properties of Tree Languages - Bojanczyk (2004) (Correct)
No context found.
M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
Modal Logics and Mu-Calculi: An Introduction - Bradfield, Stirling (2001) (12 citations) (Correct)
No context found.
M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs. J. Computer and System Science 18 194-211 (1979). 37
Kleene Algebra with Domain - Desharnais, Möller, Struth (2003) (1 citation) (Correct)
No context found.
J. M. Fischer and R. F. Ladner. Propositional dynamic logic of regular programs. J. Comput. System Sci., 18(2):194--211, 1979.
Behaviour Analysis of Communication Systems: Compositional.. - Siegle (2002) (1 citation) (Correct)
No context found.
M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. J. Comput. System Sci., 18:194--211, 1979.
Modal Kleene Algebra and Partial Correctness - Möller, Struth (2003) (Correct)
No context found.
J. M. Fischer and R. F. Ladner. Propositional dynamic logic of regular programs. J. Comput. System Sci., 18(2):194--211, 1979.
The Expressivity Of Tree Languages For Syntactic Structures - Palm (1999) (1 citation) (Correct)
No context found.
Fischer, M.J. & Ladner, R.F. (1979) Propositional dynamic logic of regular programs. Journal of Computer and System Science 18:194-211.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC