top

Sorted by First Author Last Name

Change sort order:

| Marx | Alechina | Allen | Alur | Areces | Basin | Bezhanishvili | Blackburn | Bolander | Braüner | Bull | Cate | Cresswell | Giacomo | Demri | Eijk | Franceschet | Gabbay | Gargov | Goranko | Hasle | Hodkinson | Hoffmann | Horrocks | Kaminski | Kamp | Konikowska | Lutz | Marx | Passy | Prior | Reape | Rescher | Richards | Sattler | Schaerf | Schild | Schmidt-Schauss | Schneider | Seligman | Sellink | Tobies | Tzakova | Viganò | Vlach | Areces | Hasle | Orlowska |

Marx

M. Marx. Narcissists, stepmothers and spies. In In Proceedings of DL02, 2002.
Details     BibTeX     Download: [pdf] 

Alechina

N. Alechina, S. Demri, and M. de Rijke. A Modal Perspective on Path Constraints. J. Logic and Computation, 13(6):939–956, 2003.
Details     BibTeX     Download: [pdf] 

Allen

J. Allen. Towards a general theory of action and time. Artificial Intelligence, 23:123–154, 1984.
Details     BibTeX     Download: (unavailable)

Alur

R. Alur and T. Henzinger. Logics and Models of Real-Time: A Survey. In Real Time: Theory in Practice, pp. 74–106, Springer-Verlag, 1992.
Details     BibTeX     Download: [pdf] 

R. Alur and T. Henzinger. Real-time logics: complexity and expressiveness. In Fifth Annual IEEE Symposium on Logic in Computer Science (Philadelphia, PA, 1990), pp. 390–401, IEEE Comput. Soc. Press, Los Alamitos, CA, 1990.
Details     BibTeX     Download: [pdf] 

R. Alur and T. Henzinger. A Really Temporal Logic. In 30th Annual Symposium on Foundations of Computer Science, pp. 164–169, IEEE Computer Society Press, New York, 1989.
Details     BibTeX     Download: [pdf] 

Areces

C. Areces. Logic Engineering. The Case of Description and Hybrid Logics. Ph.D. Thesis, Institute for Logic, Language and Computation, University of Amsterdam, 2000. ILLC Dissertation Series 2000--5
Details     BibTeX     Download: [pdf] 

C. Areces and R. Bernardi. In Situ Binding: A Hybrid Approach. In Inference in Computational Semantics 4 - ICoS-4, Nancy, France, Nancy, France, September 2003.
Details     BibTeX     Download: [pdf] 

C. Areces and P. Blackburn. Reichenbach, Prior and Montague: A semantic get-together. In S. Artemov, H. Barringer, A. d'Avila Garcez, L. Lamb, and J. Woods, editors, We Will Show Them: Essays in Honour of Dov Gabbay, College Publications, 2005.
Details     BibTeX     Download: [pdf] 

C. Areces and P. Blackburn. Bringing them all Together. Journal of Logic and Computation, 11(5):657–669, 2001. Special Issue on Hybrid Logics. Areces, C. and Blackburn, P. (eds.)
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, B. Martinez Hernandez, and M. Marx. Handling Boolean ABoxes. In Proceedings of the 2003 International Workshop on Description Logics (DL2003), Rome, Italy, September 2003.
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, and M. Marx. A Road-map on Complexity for Hybrid Logics. In Computer Science Logic, pp. 307–321, Springer, Madrid, Spain, 1999. Proceedings of the 8th Annual Conference of the EACSL, Madrid, September 1999.
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, and M. Marx. Repairing the Interpolation Theorem in First-Order Modal Logic. In Proceedings of the 16th Annual IEEE Symp. on Logic in Computer Science, LICS 2001, IEEE Computer Society Press, June 2001. Short Presentation
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, and M. Marx. Hybrid logic is the bounded fragment of first order logic. In Proceedings of 6th Workshop on Logic, Language , Information and Computation, WOLLIC99, pp. 33–50, Rio de Janeiro, Brazil, 1999.
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, and M. Marx. Repairing the interpolation Theorem in Quantified Modal Logic. Annals of Pure and Applied Logics, 123(1--3):287–299, 2003.
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, and M. Marx. Hybrid logics: characterization, interpolation and complexity. The Journal of Symbolic Logic, 66(3):977–1010, 2001.
Details     BibTeX     Download: [pdf] 

C. Areces, P. Blackburn, and M. Marx. The Computational Complexity of Hybrid Temporal Logics. Logic Journal of the IGPL, 8(5):653–679, 2000.
Details     BibTeX     Download: [pdf] 

C. Areces and B. ten Cate. Hybrid Logics. In P. Blackburn, F. Wolter, and J. van Benthem, editors, Handbook of Modal Logics, Elsevier, 2006.
Details     BibTeX     Download: [pdf] 

C. Areces and D. Gorín. Ordered Resolution with Selection for H(@). In Proceedings of LPAR 2004, pp. 125–141, Springer, Montevideo, Uruguay, 2005.
Details     BibTeX     Download: [pdf] 

C. Areces and J. Heguiabehere. HyLoRes: Direct Resolution for Hybrid Logics. In Proceedings of Methods for Modalities 2, Amsterdam, The Netherlands, November 2001.
Details     BibTeX     Download: [pdf] 

C. Areces and J. Heguiabehere. HyLoRes 1.0: Direct Resolution for Hybrid Logics. In Proceedings of CADE-18, pp. 156–160, Copenhagen, Denmark, July 2002.
Details     BibTeX     Download: [pdf] 

C. Areces and J. Heguiabehere. hGen: A Random CNF Formula Generator for Hybrid Languages. In Methods for Modalities 3 - M4M-3, Nancy, France, Nancy, France, September 2003.
Details     BibTeX     Download: [pdf] 

C. Areces and J. Heguiabehere. Direct Resolution for Modal-like Logics. In Proceedings of the 3rd International Workshop on the Implementation of Logics, pp. 3–16, Tbilisi, Georgia, 2002.
Details     BibTeX     Download: [pdf] 

C. Areces and J. Heguiabehere. HyLoRes: A Hybrid Logic Prover Based on Direct Resolution. In Proceedings of Advances in Modal Logic 2002, Toulouse, France, 2002.
Details     BibTeX     Download: [pdf] 

C. Areces and C. Lutz. Concrete Domains and Nominals United. In Proceedings of HyLo@LICS, Copenhagen, Denmark, July 2002.
Details     BibTeX     Download: [pdf] 

C. Areces, H. de Nivelle, and M. de Rijke. Resolution in Modal, Description and Hybrid Logic. Journal of Logic and Computation, 11(5):717–736, 2001. Special Issue on Hybrid Logics. Areces, C. and Blackburn, P. (eds.)
Details     BibTeX     Download: [pdf] 

C. Areces, H. de Nivelle, and M. de Rijke. Prefixed resolution: a resolution method for modal and description logics. In Automated deduction---CADE-16 (Trento, 1999), pp. 187–201, Springer, Berlin, 1999.
Details     BibTeX     Download: [pdf] 

C. Areces and M. de Rijke. From Description to Hybrid Logics, and Back. In F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev, editors, Advances in Modal Logic. Volume 3, CSLI Publications, 2001.
Details     BibTeX     Download: [pdf] 

Basin

D. Basin, S. Matthews, and L. Viganò. Labelled modal logics: Quantifiers. Journal of Logic, Language, and Information, 7(3):237–263, 1998.
Details     BibTeX     Download: [pdf] 

D. Basin, S. Matthews, and L. Viganò. Natural deduction for non-classical logics. Studia Logica, 60(1):119–160, 1998.
Details     BibTeX     Download: [pdf] 

D. Basin, M. Seán, and L. Viganò. Labelled propositional modal logics: Theory and practice. Journal of Logic and Computation, 7(3):685–717, 1997.
Details     BibTeX     Download: [pdf] 

Bezhanishvili

N. Bezhanishvili and B. ten Cate. Transfer results for hybrid logic. Part 1: the case without satisfaction operators. Journal of Logic and Computation, 16:177–197, 2006.
Details     BibTeX     Download: [pdf] 

N. Bezhanishvili, B. den Cate, M. Marx, and P. Viana. Sahlqvist theory and transfer results for hybrid logics. In Preliminary proceedings of Advances in Modal Logic 2004, 2004.
Details     BibTeX     Download: [pdf] 

Blackburn

P. Blackburn. Modal logic and attribute value structures. In M. de Rijke, editors, Diamonds and Defaults, Synthese Language Library, pp. 19–65, Kluwer Academic Publishers, Dordrecht, 1993.
Details     BibTeX     Download: [pdf] 

P. Blackburn. Fine Grained Theories of Time. In H. Wansing, editors, Essays on Non-Classical Logic, Kings College University press, September 2001.
Details     BibTeX     Download: [pdf] 

P. Blackburn. Internalizing labelled deduction. Journal of Logic and Computation, 10(1):137–168, 2000.
Details     BibTeX     Download: [pdf] 

P. Blackburn. Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto. Logic Journal of the IGPL, 8(3):339–625, 2000.
Details     BibTeX     Download: [pdf] 

P. Blackburn. Tense, temporal reference and tense logic. Journal of Semantics, 11:83–101, 1994.
Details     BibTeX     Download: [pdf] 

P. Blackburn. Nominal tense logic. Notre Dame Journal of Formal Logic, 34:56–83, 1993.
Details     BibTeX     Download: [pdf] 

P. Blackburn. Nominal Tense Logic and Other Sorted Intensional Frameworks. Ph.D. Thesis, Centre for Cognitive Science, University of Edinburgh, 1990.
Details     BibTeX     Download: (unavailable)

P. Blackburn, A. Burchard, and S. Walter. Hydra: a tableaux-based prover for basic hybrid logic. In Proceedings of Methods for Modalities 2, Amsterdam, The Netherlands, November 2001.
Details     BibTeX     Download: [pdf] 

P. Blackburn and B. ten Cate. Pure Extensions, Proof Rules, and Hybrid Axiomatics. In Preliminary Proceedings of Advances in Modal Logic 2004, 2004.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Marx. A Tableaux System for Quantified Hybrid Logic. In Proceedings of Methods for Modalities 2, Amsterdam, The Netherlands, November 2001.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Marx. Tableaux for Quantified Hybrid Logic. In Automated Reasoning with Analytic Tableaux and Related Method, pp. 38–52, Springer Verlag, 2002.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Marx. Remarks on D. Gregory's ``Actually'' Operator . Journal of Philosophical Logic, 31(3):281–288, 2002.
Details     BibTeX     Download: [pdf] 

P. Blackburn and J. Seligman. What are hybrid languages?. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic, pp. 41–62, CSLI Publications, Stanford University, 1998.
Details     BibTeX     Download: [pdf] 

P. Blackburn and J. Seligman. Hybrid Languages. Journal of Logic, Language and Information, 4:251–272, 1995.
Details     BibTeX     Download: [pdf] 

P. Blackburn and E. Spaan. A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language and Information, 2:129–169, 1993.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Tzakova. Hybrid languages and temporal logic. Logic Journal of the IGPL, 7(1):27–54, 1999.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Tzakova. Hybrid completeness. Logic Journal of the IGPL, 6(4):625–650, 1998.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Tzakova. Hybrid Completeness. Logic Journal of the IGPL, 6(4):625–650, 1998.
Details     BibTeX     Download: [pdf] 

P. Blackburn and M. Tzakova. Hybridizing concept languages. Annals of Mathematics and Artificial Intelligence, 24:23–49, 1998.
Details     BibTeX     Download: [pdf] 

Bolander

T. Bolander and P. Blackburn. Terminating Tableau Calculi for Hybrid Logics extending K. In Methods for Modalities 5, Cachan, France, 2007.
Details     BibTeX     Download: [pdf] 

T. Bolander and P. Blackburn. Termination for Hybrid Tableaus. Journal of Logic and Computation, 17(3):517–554, Oxford University Press, 2007.
Details     BibTeX     Download: [pdf] 

T. Bolander and T. Braüner. Two Tableau-Based Decision procedures for Hybrid Logic. In 4th Methods for Modalities Workshop (M4M), Informatik-Bericht Nr. 194, pp. 79–96, Humboldt-Universität zu Berlin, 2005.
Details     BibTeX     Download: (unavailable)

Braüner

T. Braüner. Natural Deduction for First-Order Hybrid Logic. Journal of Logic, Language and Information, 14:173–198, 2005.
Details     BibTeX     Download: (unavailable)

T. Braüner. Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere. Studia Logica, 81:191–226, 2005.
Details     BibTeX     Download: (unavailable)

T. Braüner. Natural Deduction for Hybrid Logics. Journal of Logic and Computation, 14(3):329–353, 2004.
Details     BibTeX     Download: [pdf] 

T. Braüner. Two Natural Deduction Systems for Hybrid Logic: A Comparison. Journal of Logic, Language and Information, 13:1–23, 2004.
Details     BibTeX     Download: (unavailable)

T. Braüner and V. de Paiva. Intuitionistic Hybrid Logic. Journal of Applied Logic, 2005. To appear.
Details     BibTeX     Download: (unavailable)

Bull

R. Bull. An approach to tense logic. Theoria, 36:282–300, 1970.
Details     BibTeX     Download: (unavailable)

Cate

B. ten Cate. Interpolation for extended modal languages. Journal of Symbolic Logic, 70(1):223–234, 2005.
Details     BibTeX     Download: [pdf] 

B. ten Cate. Model theory for extended modal languages. Ph.D. Thesis, University of Amsterdam, 2005. ILLC Dissertation Series DS-2005-01
Details     BibTeX     Download: [pdf] 

B. ten Cate and M. Franceschet. On the complexity of hybrid logics with binders. In Proceedings of Computer Science Logic 2005, pp. 339–354, Springer Verlag, 2005.
Details     BibTeX     Download: [pdf] 

B. ten Cate and M. Franceschet. Guarded fragments with constants. Journal of Logic, Language and Information, 14(3):281–288, 2005.
Details     BibTeX     Download: [pdf] 

B. ten Cate, M. Marx, and P. Viana. Hybrid logics with Sahlqvist axioms. Logic Journal of the IGPL, 13(3):293–300, 2005.
Details     BibTeX     Download: [pdf] 

Cresswell

M. Cresswell. Semantic Indexicality, Kluwer, 1996.
Details     BibTeX     Download: (unavailable)

M. Cresswell. Entities and Indices, Dordrecht: Reidel, 1990.
Details     BibTeX     Download: (unavailable)

Giacomo

G. De Giacomo. Decidability of class-based knowledge representation formalisms. Ph.D. Thesis, Universitá di Roma ``La Sapienza'', 1995.
Details     BibTeX     Download: [pdf] 

G. De Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. 12th National Conference on Artificial Intelligence (AAAI'94), pp. 205–212, 1994.
Details     BibTeX     Download: [pdf] 

Demri

S. Demri. Sequent calculi for nominal tense logics: a step towards mechanization?. In Proceedings of the Conference on Tableaux Calculi and Related Methods (TABLEAUX), pp. 140–154, Springer Verlag, Saratoga Springs, USA, 1999.
Details     BibTeX     Download: [pdf] 

S. Demri and D. Gabbay. On modal logics characterized by models with relative accessibility relations: Part I. Studia Logica, 65(3):323–353, 2000.
Details     BibTeX     Download: [pdf] 

S. Demri and R. Goré. Cut-free display calculi for nominal tense logics. In Proceedings of the Conference on Tableaux Calculi and Related Methods, (TABLEAUX), pp. 155–170, Springer Verlag, Saratoga Springs, USA, 1999.
Details     BibTeX     Download: [pdf] 

S. Demri and B. Konikowska. Relative similarity logics are decidable: reduction to FO$^2$ with equality. In JELIA'98, pp. 279–293, Springer-Verlag, 1998.
Details     BibTeX     Download: [pdf] 

S. Demri, R. Lazic, and D. Nowak. On the freeze quantifier in constraint LTL: decidability and complexity. Technical Report LSV-05-03, Laboratoire Specification et Verification, 2005.
Details     BibTeX     Download: [pdf] 

S. Demri and U. Sattler. Automata-theoretic decision procedures for information logics. Fundamenta Informaticae, 53(1):1–22, January 2002.
Details     BibTeX     Download: [pdf] 

Eijk

R. van Eijk, F. de Boer, W. van der Hoek, and J. Meyer. Modal Logic with Bounded Quantification over Worlds. Journal of Logic and Computation, 11(5):701–715, 2001. Special Issue on Hybrid Logics. Areces, C. and Blackburn, P. (eds.)
Details     BibTeX     Download: [pdf] 

Franceschet

M. Franceschet and M. de Rijke. Model checking for hybrid logics (with an application to semistructured data). Journal of Applied Logic, 4(3):279–304, 2006.
Details     BibTeX     Download: [pdf] 

M. Franceschet, M. de Rijke, and H. Schlingloff. Hybrid Logics on Linear Structures: Expressivity and Complexity. In Proceedings of the International Symposium on temporal representation and reasoning - International Conference on Temporal Logic, pp. 166–173, 2003.
Details     BibTeX     Download: [pdf] 

Gabbay

D. Gabbay. An irreflexivity lemma. In U. Mönnich, editors, Aspects of Philosophical Logic, pp. 67–89, Reidel, 1981.
Details     BibTeX     Download: (unavailable)

D. Gabbay. Labelled Deductive Systems, Oxford: Clarendon Press, 1996.
Details     BibTeX     Download: (unavailable)

D. Gabbay. Investigations in modal and tense logics with applications to problems in Philosophy and Linguistics, Dordrecht: Reidel, 1976.
Details     BibTeX     Download: (unavailable)

D. Gabbay and G. Malod. Naming worlds in modal and temporal logic. Journal of logic, language and information, 2000.
Details     BibTeX     Download: [pdf] 

Gargov

G. Gargov and V. Goranko. Modal logic with names. Journal of Philosophical Logic, 22(6):607–636, 1993.
Details     BibTeX     Download: (unavailable)

G. Gargov and S. Passy. Determinism and looping in combinatory PDL. Theoretical Computer Science, 61:259–277, 1988.
Details     BibTeX     Download: (unavailable)

G. Gargov, S. Passy, and T. Tinchev. Modal environment for boolean speculations (preliminary report). In D. Skordev, editors, Mathematical Logic and its Applications. Proceedings of the Summer School and Conference dedicated to the 80th Anniversary of Kurt Gödel, pp. 253–263, Plenum Press, Druzhba, 1987.
Details     BibTeX     Download: (unavailable)

Goranko

V. Goranko. Temporal Logic with Reference Pointers and Computational Tree Logics. Journal of Applied Non-Classical Logics, 9(2--3):345–368, 1999.
Details     BibTeX     Download: [pdf] 

V. Goranko. An interpretation of computational tree logics into temporal logics with reference pointers. Technical Report 2/96, Verslagreeks van die Department Wiskunde, RAU, Department of Mathematics, Rand Afrikaans University, 1996.
Details     BibTeX     Download: (unavailable)

V. Goranko. Hierarchies of modal and temporal logics with reference pointers. Journal of Logic, Language and Information, 5(1):1–24, 1996.
Details     BibTeX     Download: [pdf] 

V. Goranko. Temporal logic with reference pointers. In Temporal logic, LNCS, pp. 133–148, Berlin: Springer, 1994.
Details     BibTeX     Download: [pdf] 

V. Goranko and D. Vakarelov. Sahlqvist Formulas in Hybrid Polyadic Modal Logics. Journal of Logic and Computation, 11(5):737–754, 2001. Special Issue on Hybrid Logics. Areces, C. and Blackburn, P. (eds.)
Details     BibTeX     Download: [pdf] 

Hasle

P. Hasle and P. Ohrstrom. A. N. Prior's Rediscovery of Tense Logic. Erkenntnis, 39:23–50, 1993.
Details     BibTeX     Download: [pdf] 

Hodkinson

I. Hodkinson. Hybrid Formulas and Elementarily Generated Modal Logics. Notre Dame Journal of Formal Logic, 47(4):443–478, 2006.
Details     BibTeX     Download: (unavailable)

Hoffmann

G. Hoffmann and C. Areces. HTab : a Terminating Tableaux System For Hybrid Logic. In Method For Modalities 5, Cachan, France, 2007.
Details     BibTeX     Download: [pdf] 

Horrocks

I. Horrocks, B. Glimm, and U. Sattler. Hybrid Logics and Ontology Languages. Electron. Notes Theor. Comput. Sci., 174(6):3–14, Elsevier Science Publishers B. V., Amsterdam, The Netherlands, The Netherlands, 2007.
Details     BibTeX     Download: [pdf] 

Kaminski

M. Kaminski and G. Smolka. Hybrid Tableaux for the Difference Modality. In Methods for Modalities 5, Cachan, France, 2007.
Details     BibTeX     Download: [pdf] 

Kamp

H. Kamp. Formal properties of ``now''. Theoria, 37:227–273, 1971.
Details     BibTeX     Download: (unavailable)

Konikowska

B. Konikowska. A logic for reasoning about relative similarity. Studia Logica, 58:185–226, 1997.
Details     BibTeX     Download: [pdf] 

B. Konikowska. A formal language for reasoning about indiscernibility. Bulletin of the Polish Academy of Sciences, 35:239–249, 1987.
Details     BibTeX     Download: (unavailable)

Lutz

C. Lutz, C. Areces, I. Horrocks, and U. Sattler. Keys, Nominals, and Concrete Domains. Journal of Artificial Intelligence Research, 23:667–726, 2004.
Details     BibTeX     Download: [pdf] 

C. Lutz, C. Areces, I. Horrocks, and U. Sattler. Keys, Nominals, and Concrete Domains. In Eighteenth International Joint Conference on Artificial Intelligence - IJCAI'03, Acapulco, Mexico, pp. 349–354, Acapulco, Mexico, August 2003.
Details     BibTeX     Download: [pdf] 

Marx

M. Marx. Relation Algebra with Binders. Journal of Logic and Computation, 11(5):691–700, 2001.
Details     BibTeX     Download: [pdf] 

M. Marx and Y. Venema. Multi-dimensional Modal Logic, Applied Logic, Kluwer Academic Publishers, 1997.
Details     BibTeX     Download: (unavailable)

Passy

S. Passy and T. Tinchev. An essay in combinatory dynamic logic. Information and Computation, 93:263–332, 1991.
Details     BibTeX     Download: (unavailable)

S. Passy and T. Tinchev. Quantifiers in combinatory PDL: completeness, definability, incompleteness. In Fundamentals of Computation Theory FCT 85, LNCS, pp. 512–519, Springer, 1985.
Details     BibTeX     Download: (unavailable)

S. Passy and T. Tinchev. PDL with data constants. Information Processing Letters, 20:35–41, 1985.
Details     BibTeX     Download: (unavailable)

Prior

A. Prior. Now. Nous, 2:101–119, 1968.
Details     BibTeX     Download: (unavailable)

A. Prior. Past, Present and Future, Oxford University Press, 1967.
Details     BibTeX     Download: (unavailable)

A. Prior and K. Fine. Worlds, Times, and Selves, University of Massachusetts Press, 1977.
Details     BibTeX     Download: (unavailable)

Reape

M. Reape. A feature value logic. In C. Rupp, M. Rosner, and R. Johnson, editors, Constraints, Language and Computation, Synthese Language Library, pp. 77–110, Academic Press, 1994.
Details     BibTeX     Download: (unavailable)

Rescher

N. Rescher and A. Urquhart. Temporal Logic, Springer, 1971.
Details     BibTeX     Download: (unavailable)

Richards

B. Richards, I. Bethke, J. van der Does, and J. Oberlander. Temporal representation and inference, Academic Press, 1989.
Details     BibTeX     Download: (unavailable)

Sattler

U. Sattler and M. Vardi. The Hybrid mu-Calculus. In Proceedings of IJCAR'01, Siena, June 2001.
Details     BibTeX     Download: [pdf] 

Schaerf

A. Schaerf. Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity, and Semantic Issues. Ph.D. Thesis, Universá di Roma ``La Sapienza'', 1994.
Details     BibTeX     Download: [pdf] 

Schild

K. Schild. A correspondence theory for terminological logics. In Proceedings of the 12th IJCAI, pp. 466–471, 1991.
Details     BibTeX     Download: [pdf] 

Schmidt-Schauss

M. Schmidt-Schauss and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48:1–26, 1991.
Details     BibTeX     Download: (unavailable)

Schneider

T. Schneider. The Complexity of Hybrid Logics over Restricted Frame Classes. Ph.D. Thesis, Department of Computer Science, University of Jena, 2007.
Details     BibTeX     Download: [pdf] 

Seligman

J. Seligman. The logic of correct description. In M. de Rijke, editors, Advances in Intensional Logic, Applied Logic Series, pp. 107–135, Kluwer, 1997.
Details     BibTeX     Download: [pdf] 

J. Seligman. Internalization: The Case of Hybrid Logics. Journal of Logic and Computation, 11(5):671–689, 2001. Special Issue on Hybrid Logics. Areces, C. and Blackburn, P. (eds.)
Details     BibTeX     Download: [pdf] 

J. Seligman. Proof theory for contextual reasoning. Unpublished 1998.
Details     BibTeX     Download: (unavailable)

J. Seligman. Situated consequence in elementary situation theory. Technical Report IULG-92-16, Indiana University, 1992.
Details     BibTeX     Download: [pdf] 

J. Seligman. A cut-free sequent calculus for elementary situated reasoning. Technical Report HCRC-RP 22, HCRC, Edinburgh, 1991.
Details     BibTeX     Download: [pdf] 

Sellink

M. Sellink. Verifying modal formulae over I/O-automata by means of type theory.. Utrecht University, 1994.
Details     BibTeX     Download: [pdf] 

Tobies

M. Tobies. The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics. Journal of Artificial Intelligence Research, 12:199–217, 2000.
Details     BibTeX     Download: [pdf] 

Tzakova

M. Tzakova. Tableau calculi for hybrid logics. In Proceedings of the Conference on Tableaux Calculi and Related Methods (TABLEAUX), pp. 278–292, Springer Verlag, Saratoga Springs, USA, 1999.
Details     BibTeX     Download: [pdf] 

Viganò

L. Viganò. Labelled Non-Classical Logics, Kluwer Academic Publishers, Dordrecht, 2000.
Details     BibTeX     Download: (unavailable)

Vlach

F. Vlach. Now and Then: a formal study in the logic of tense anaphora. Ph.D. Thesis, UCLA, 1973.
Details     BibTeX     Download: (unavailable)

Areces

C. Areces and P. Blackburn, editors. Hybrid Logics, Special Issue in the Journal of Logic and Computation, Oxford University Press, October 2001.
Details     BibTeX     Download: (unavailable)

Hasle

P. Hasle, P. Øhrstrøm, t. Braüner, and J. Copeland, editors. Revised and Expanded Edition of Arthur N. Prior: Papers on Time and Tense, Oxford University Press, 2003. 342 pages
Details     BibTeX     Download: (unavailable)

Orlowska

E. Orlowska, editors. Incomplete Information: Rough Set Analysis, Studies in Fuzziness and Soft Computing, Physica-Verlag, 1997.
Details     BibTeX     Download: (unavailable)


Generated by bib2html.pl (written by Patrick Riley ) on Mon Aug 10, 2009 14:52:34