Search Results

Dynamic Topological Completeness for R²

Author: Duque, David FernÁndez

Source: Logic Journal of the IGPL, Volume 15, Number 1, January 2007 , pp. 77-107(31)

Publisher: Oxford University Press

The Undecidability of Propositional Adaptive Logic

Authors: Horsten, Leon; Welch, Philip

Source: Synthese, Volume 158, Number 1, September 2007 , pp. 41-60(20)

Publisher: Springer

On Dynamic Topological and Metric Logics

Authors: Konev, B.; Kontchakov, R.; Wolter, F.; Zakharyaschev, M.

Source: Studia Logica, Volume 84, Number 1, September 2006 , pp. 129-160(32)

Publisher: Springer

Multi-valued Calculi for Logics Based on Non-determinism

Authors: Avron, Arnon; Konikowska, Beata

Source: Logic Journal of the IGPL, Volume 13, Number 4, July 2005 , pp. 365-387(23)

Publisher: Oxford University Press

Multi-Agent Dynamic Logics with Informational Test

Authors: Schmidt, Renate; Tishkovsky, Dmitry

Source: Annals of Mathematics and Artificial Intelligence, Volume 42, Numbers 1-3, September 2004 , pp. 5-36(32)

Publisher: Springer

Changing Modalities

Author: Gerard R. Renardel De Lavalette

Source: Journal of Logic and Computation, Volume 14, Number 2, April 2004 , pp. 251-275(25)

Publisher: Oxford University Press

Branching within Time: An Expressively Complete and Elementarily Decidable Temporal Logic for Time Granularity

Authors: Franceschet M.; Montanari A.

Source: Research on Language and Computation, Volume 1, Numbers 3-4, September 2003 , pp. 229-263(35)

Publisher: Springer

An Overview of Tableau Algorithms for Description Logics

Authors: Baader F.; Sattler U.

Source: Studia Logica, Volume 69, Number 1, October 2001 , pp. 5-40(36)

Publisher: Springer

Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL

Authors: De Giacomo G.; Massacci F.

Source: Information and Computation, Volume 162, Number 1, 10 October 2000 , pp. 117-137(21)

Publisher: Elsevier

Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of -Formulae

Authors: Demri S.; Orowska E.

Source: Studia Logica, Volume 62, Number 2, March 1999 , pp. 177-200(24)

Publisher: Springer

Eliminating ``Converse'' from Converse PDL

Author: de Giacomo G.

Source: Journal of Logic, Language and Information, Volume 5, Number 2, April 1996 , pp. 193-208(16)

Publisher: Springer

Complexity results for two-way and multi-pebble automata and their logics

Authors: Globerman N.; Harel D.

Source: Theoretical Computer Science, Volume 169, Number 2, 5 December 1996 , pp. 161-184(24)

Publisher: Elsevier