Carlos Areces

Contents Fragmentary Memories (2008)

Carlos Areces, Raffaella Bernardi

Based on work done in collaboration

Abstract (2008)

Even though residuation is at the core of Categorial Grammar [11], it is not always immediate to realize how standard logic systems like Multi-modal Categorial Type Logics (MCTL) [17] actually embody...

Reichenbach, Prior and Montague: A semantic get-together (2008)

Carlos Areces, Patrick Blackburn

What do you write on for the logician who has written (or edited a Handbook) on just about everything? Finding something new isn’t an option. So in the hope of reviving pleasant memories, we’ve...

Experiments in Theorem Proving for Topological Hybrid Logic (2008)

Dmitry Sustretov, Guillaume Hoffmann, Carlos Areces, Patrick Blackburn

This paper discusses two experiments in theorem proving for hybrid logic under the topological interpretation. We begin by discussing the topological interpretation of hybrid logic and noting what it...

1 Controlled Model Exploration (2008)

The Course Day by Day (2008)

abstract. We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce nondeterminism and they feature restrictions on the modal operators,...

Abstract Hybrid Logics (2008)

an overview of the course

Carlos Areces, Inria Lorraine, Balder Ten Cate

Hybrid languages are modal languages that have special symbols for naming individual states in models. Their history can be traced back to work of Arthur Prior in the fifties. The subject has...

Journal of Artificial Intelligence Research () Submitted; published Keys, Nominals, and Concrete Domains (2008)

Carsten Lutz, Carlos Areces, Ian Horrocks, Ulrike Sattler

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to “concrete ” domains like numbers and strings with built-in predicates such as...

AND INFORMATION Contents (2008)

F. Wolter, H. Wansing, M. De Rijke, M. Zakharyaschev, Carlos Areces, ...

v

An Approach to Feature Interaction via Stable Models (2007)

Rafael Accorsi, Carlos Areces, Wiet Bouma, Maarten De Rijke

Abstract. We report on ongoing work on using a constraint-based approach towards feature interaction. Starting from a logic specication of the Basic Call Service (BCS), we obtain a labeled transition...

Rafael Accorsi, Carlos Areces

Abstract. In this paper we report on ongoing work on using a constraintbased approach towards feature interaction. From a logic specication of the Basic Call Service (BCS), we derive a labelled...

1 (2007)

Bernadette Martnez Hernandez, Maarten Marx, Carlos Areces, Maarten De Rijke, O Nuallain

We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and...

Supervisors (2007)

I would like to thank my parents and friends for the support given during the elaboration of this thesis. I want to give an special recognition to my supervisors for their guidance and patience. It...

Decomposing Modal Logic (2007)

Gabriel Infante-lopez, Carlos Areces, Maarten Rijke

We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce non-determinism and they feature restrictions on the modal operators, which may...

1 Controlled Model Exploration (2007)

Keys, Nominals, and Concrete Domains (2007)

abstract. We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce nondeterminism and they feature restrictions on the modal operators,...

Carsten Lutz, Carlos Areces, Ian Horrocks, Ulrike Sattler

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to “concrete ” domains such as numbers and strings. We propose to extend such DLs...

Keys, Nominals, and Concrete Domains (2007)

Lehrstuhl Für Automatentheorie, Tu Dresden, Carsten Lutz, Carsten Lutz, Carlos Areces, Carlos Areces, ...

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to “concrete ” domains such as numbers and strings with built-in predicates such as...

Direct Resolution for Modal-like Logics (2007)

Direct resolution and hybrid logics: Designing resolution methods that can directly (without translation into large background languages) be applied to modal logics, received some attention in the...

b (2007)

Quanti ed hybrid logic is quantied modal logic extended with apparatus for naming states and asserting that a formula is true at a named state While interpolation and Beth's denability theorem...

Raaella Bernardi (2007)

Decomposing Modal Logic (2007)

Even though residuation is at the core of Categorial Grammar [11], it is not always immediate to realize how standard logic systems like Multi-modal Categorial Type Logics (MCTL) [17] actually embody...

Carlos Areces, Maarten Rijke

We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce non-determinism and they feature restrictions on the modal operators, which may...

1 (2007)

We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and...

b (2007)

Quanti ed hybrid logic is quantied modal logic extended with apparatus for naming states and asserting that a formula is true at a named state While interpolation and Beth's denability theorem...

Carlos Areces, Patrick Blackburn, Samuel R. Delany

[...] No way to say warm in French. There was only hot and tepid. If there's no word for it, how do you think about it? [...] Imagine, in Spanish having to assign a gender to every object: dog,...

A Simple Ordering for Deciding Modal Logic (2007)

Abstract. Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages for they...

Carlos Areces, Rosella Gennari, Juan Heguiabehere, Maarten De Rijke

Abstract. We describe a new resolution-based decision procedure for basic uni-modal and multi-modal logic. The procedure is based on semantic intuitions about a strong form of the tree model...

Contents (2007)

Expressiveness Revisited (2007)

Based on work done in collaboration

Carlos Areces, Coventry Cv Al, Maarten De Rijke

We consider two recently proposed definitions of the expressive power of description logics, one due to Baader, the other due to Kurtonina and de Rijke. The proposals are non-equivalent, and we...

CENTER FOR THE STUDY OF LANGUAGE (2007)

Abstract: We provide two different model theoretic characterizations of a fragment of first-order logic which we call d-Horn formulas. This fragment is dual to the well known Horn fragment and has...

Update, the infinite case (2007)

Rafael Accorsi, Carlos Areces, Wiet Bouma, Maarten De Rijke

Abstract. We report on ongoing work on using a constraint-based approach towards feature interaction detection. Constraint programming is introduced as a natural way of handling the inherent...

Carlos Areces, Christof Monz, Hans De Nivelle, Maarten De Rijke

We provide a set of postulates that characterizes Katsuno and Mendelzon 's update operation [2] for a possibly infinite propositional language. In this way we extend their original operator...

Contents (2007)

In this short note we discuss several perspectives on the notion of Guarded Fragments (GFs) of first-order logic first introduced by Andreka, van Benthem and Nemeti. We focus on computational...

AND INFORMATION Contents (2007)

F. Wolter, H. Wansing, M. De Rijke, M. Zakharyaschev, Carlos Areces, Maarten De Rijke

Iterated Revision in the Spirit of Update: A Lazy Update (2007)

Repairing the Interpolation Theorem in First-Order Modal Logic (2007)

Since they were introduced, AGM revision and Katsuno and Mendelzon's update have been considered orthogonal theory change operations serving different purposes. This work provides a new...

Introduction. Hybrid logics are extensions of orthodox modal logics in which it is possible to name worlds (or states, or times,...). Such extensions have proved interesting for a number of reasons....

Raaella Bernardi (2007)

Electronic Notes in Theoretical Computer Science 47 (2002) (2007)

Even though residuation is at the core of Categorial Grammar [11], it is not always immediate to realize how standard logical systems like Multi-modal Categorial Type Logics (MCTL) [17] actually...

Url Http Www, Carlos Areces, Michael Moortgat

The introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are order-preserving; in this paper instead, we consider...

Modal Logic as a Design Notation (2007)

Carlos Areces, Miguel Felder, Dan Hirsch, Miguel Hirsch, Daniel Yankelevich

A notation to describe software system designs is given together with the means to verify properties over them. Designs are considered as models of a modal logic. The procedure to derive the modal...

HyLoRes: Direct Resolution for Hybrid Logics (2007)

HyLoRes 1.0: Direct Resolution for Hybrid Logics Carlos Areces and Juan Heguiabehere (2007)

Introduction Hybrid languages are modal languages that allow direct reference to the elements of the model. Already the basic hybrid language (H(@)) which extends the basic modal language with the...

Language And Inference, Carlos Areces, Juan Heguiabehere

eau algorithms but on (direct) resolution. HyLoRes implements a version of the \given clause" algorithm, which has become the skeleton underlying most rst-order provers. In contrast to...

HTab: A Terminating Tableaux System for Hybrid Logic (2007)

Hoffmann, Guillaume, Areces, Carlos

Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof...

Experiments in Theorem Proving for Topological Hybrid Logic (2007)

Sustretov, Dmitry, Hoffmann, Guillaume, Areces, Carlos, Blackburn, Patrick

This paper discusses two experiments in theorem proving for hybrid logic under the topological interpre-tation. We begin by discussing the topological interpretation of hybrid logic and noting what...

HTab: A Terminating Tableaux System for Hybrid Logic (2007)

Hoffmann, Guillaume, Areces, Carlos

Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof...

Experiments in Theorem Proving for Topological Hybrid Logic (2007)

Sustretov, Dmitry, Hoffmann, Guillaume, Areces, Carlos, Blackburn, Patrick

This paper discusses two experiments in theorem proving for hybrid logic under the topological interpre-tation. We begin by discussing the topological interpretation of hybrid logic and noting what...

HTab: Terminating tableaux system for hybrid logic. Master’s thesis, Département de formation doctorale en informatique (2007)

Guillaume Hoffmann, Carlos Areces

Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof...

HTab: Terminating tableaux system for hybrid logic. Master’s thesis, Département de formation doctorale en informatique (2007)

Guillaume Hoffmann, Carlos Areces

Hybrid logic is a formalism that is closely related to both modal logic and description logic. A variety of proof mechanisms for hybrid logic exist, but the only widely available implemented proof...

Haskell Communities and Activities Report (2007)

Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Carlos Areces, ...

You are reading the twelfth edition of the Haskell Communities and Activities Report – as always, containing entries from enthusiastic Haskellers all over the world. This edition has 138 entries,...

Team TALARIS (2007)

Carlos Areces, Inria Lorraine

Hybrid Logics are usually presented as an extension of modal logics where we can explicitly refer to the elements in the model. In this paper we will start by introducing hybrid logics from that...

Methods for Modalities 3 (2005)

Areces, Carlos

Ordered Resolution with Selection for H(@) (2005)

Areces, Carlos, Gorin, Daniel

Methods for Modalities 3 (2005)

Areces, Carlos

Ordered Resolution with Selection for H(@) (2005)

Areces, Carlos, Gorin, Daniel

Ordered resolution with selection for h (2005)

Carlos Areces, Loria Inria Lorraine

Abstract. The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic modal logic. The resulting logic gains expressive power without increasing the complexity...

Ordered resolution with selection for h (2005)

Carlos Areces, Daniel Gorín, Loria Inria Lorraine

Abstract. The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic modal logic. The resulting logic gains expressive power without increasing the complexity...

Also electronically available as CEUR Publication at (2004)

Volker Haarslev, Ralf Möller, Volker Haarslev, Ralf Möller, Carlos Areces, Diego Calvanese, ...

devoted to discussing developments and applications of knowledge representation formalisms based on Description Logics. The list of International Workshops on Description Logics can be found at

Repairing the interpolation theorem in quantified modal logic (2003)

Areces, Carlos, Blackburn, Patrick, Marx, Maarten

Quantified hybrid logic is quantified modal logic extended with apparatus for naming states and asserting that a formula is true at a named state. While interpolation and Beth's definability theorem...

Repairing the interpolation theorem in quantified modal logic (2003)

Areces, Carlos, Blackburn, Patrick, Marx, Maarten

Quantified hybrid logic is quantified modal logic extended with apparatus for naming states and asserting that a formula is true at a named state. While interpolation and Beth's definability theorem...

hGen: A Random CNF Formula Generator for Hybrid Languages (2003)

Areces, Carlos, Heguiabehere, Juan

hGen is a random CNF (conjunctive normal form) generator of formulas for sublanguages of H(@,\downarrow, A).

In Situ Binding: A Hybrid Approach (2003)

Areces, Carlos, Bernardi, Raffaella

Due to the concatenative interpretation of its composition operator, the base categorial type logic \NLd encounters some difficulties when analyzing non-concatenative material. Hence, modeling...

Areces, Carlos, Blackburn, Patrick, Martinez Hernandez, Bernardette, Marx, Maarten

Keys, Nominals, and Concrete Domains (2003)

Lutz, Carsten, Areces, Carlos, Horrocks, Ian, Sattler, Ulrike

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to `concrete'' domains such as numbers and strings with built-in predicates such as

hGen: A Random CNF Formula Generator for Hybrid Languages (2003)

Areces, Carlos, Heguiabehere, Juan

hGen is a random CNF (conjunctive normal form) generator of formulas for sublanguages of H(@,\downarrow, A).

In Situ Binding: A Hybrid Approach (2003)

Areces, Carlos, Bernardi, Raffaella

Due to the concatenative interpretation of its composition operator, the base categorial type logic \NLd encounters some difficulties when analyzing non-concatenative material. Hence, modeling...

Areces, Carlos, Blackburn, Patrick, Martinez Hernandez, Bernardette, Marx, Maarten

Keys, Nominals, and Concrete Domains (2003)

Lutz, Carsten, Areces, Carlos, Horrocks, Ian, Sattler, Ulrike

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to `concrete'' domains such as numbers and strings with built-in predicates such as

Deciding Modal Logics through Relational Translations into GF2 (2003)

De Nivelle, Hans, Demri, Stéphane, Areces, Carlos, Blackburn, Patrick

We provide a simple translation from the satisfiability problem for regular grammar logics with converse into {GF2}, the intersection of the guarded fragment and the 2-variable fragment of...

editors. Methods for Modalities 3 (2003)

et ses Applications ” organized the third instance of the Methods for Modalities Workshop (M4M-3) in Nancy, France. As in the previous instances of the workshop, the focus of the meeting was on...

Carlos Areces, Patrick Blackburn, Bernadette Martinez Hernandez, Maarten Marx

We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear reduction of such...

Repairing the Interpolation Theorem in Quantified Modal Logic (2003)

Repairing the interpolation theorem in quantified modal logic (2003)

Quanti ed hybrid logic is quanti ed modal logic extended with apparatus for naming states and asserting that a formula is true at a named state. While interpolation and Beth's de nability...

Carlos Areces, Patrick Blackburn, Maarten Marx A

Quantified hybrid logic is quantified modal logic extended with apparatus for naming states and asserting that a formula is true at a named state While interpolation and Beth’s definability theorem...

Carlos Areces, Patrick Blackburn, Bernadette Martinez Hernandez, Maarten Marx

We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear reduction of such...

HyLoRes: A hybrid logic prover based on direct resolution (2002)

HyLoRes: A hybrid logic prover based on direct resolution (2002)

Abstract: In recent years, an important number of theoretical results concerning axiomatizability, proof systems (tableaux, natural deduction, etc.), interpolation, expressive power, complexity, etc....

Concrete Domains and Nominals United (2002)

The System: HyLoRes is a direct resolution prover for hybrid logics implementing the sound and complete algorithm for satisfiability of sentences in H(@; #) presented in [2]. The most interesting...

Carlos Areces, Carsten Lutz

While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be...

Supervisors (2002)

Bernadette Martínez Hernández, Maarten Marx, Carlos Areces, Dick De Jongh, Maarten De Rijke, Breanndán Ó Nualláin

I would like to thank my parents and friends for the support given during the elaboration of this thesis. I want to give an special recognition to my supervisors for their guidance and patience. It...

HyLoRes: A hybrid logic prover based on direct resolution (2002)

HyLoRes: A Hybrid Logic Prover (2002)

Abstract: In recent years, an important number of theoretical results concerning axiomatizability, proof systems (tableaux, natural deduction, etc.), interpolation, expressive power, complexity, etc....

Based On Direct, Carlos Areces, Juan Heguiabehere, Hybrid Logics

c weaker than FOL [2] (but still undecidable). See the Hybrid Logic site at http://www.hylo.net for a broad on-line bibliography. In recent years, an important number of theoretical results...

HyLoRes: A hybrid logic prover based on direct resolution (2002)

Resolution in modal, description and hybrid logic (2001)

The System: HyLoRes is a direct resolution prover for hybrid logics implementing the sound and complete algorithm for satisfiability of sentences in

Areces,Carlos, De Rijke,Maarten, De Nivelle,Hans

Resolution in modal, description and hybrid logic (2001)

Areces, Carlos, De Rijke, Maarten, De Nivelle, Hans

Galois Connections in Categorial Type Logic (2001)

Carlos Areces, Raffaella Bernardi, Michael Moortgat

The introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are order-preserving; in this paper instead, we consider...

Analyzing the Core of Categorial Grammar (2001)

Carlos Areces, Raffaella Bernardi, Categorial Grammar

Even though residuation is at the core of Categorial Grammar [14], it is not always immediate to realize how standard logical systems like Multi-modal Categorial Type Logics (MCTL) [20] actually...

Rijke. Resolution in modal, description and hybrid logic (2001)

Carlos Areces, Hans Nivelle, Maarten De Rijke

We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and...

Rijke. Resolution in modal, description and hybrid logic (2001)

Carlos Areces, Hans Nivelle

Abstract We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable...

Bringing them all together (2001)

Carlos Areces, Patrick Blackburn, Samuel R. Delany

[...] No way to say warm in French. There was only hot and tepid. If there’s no word for it, how do you think about it? [...] Imagine, in Spanish having to assign a gender to every object: dog,...

Bringing them all together (2001)

Carlos Areces, Patrick Blackburn, Samuel R. Delany

[...] No way to say warm in French. There was only hot and tepid. If there’s no word for it, how do you think about it? [...] Imagine, in Spanish having to assign a gender to every object: dog,...

Bringing them all Together (2001)

Areces, Carlos, Blackburn, Patrick

Resolution in Modal, Description and Hybrid Logic (2001)

Areces, Carlos, De Rijke, Maarten, De Nivelle, Hans

We provide a resolution‐based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable...

Rijke. Feature Interaction as a Satisfiability Problem (2000)

Rijke. Tree-based Heuristics in Modal Theorem Proving (2000)

We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the...

Carlos Areces, Rosella Gennari, Juan Heguiabehere, Maarten De Rijke

Abstract. We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas. We...

Rijke. Feature Interaction as a Satisfiability Problem (2000)

Carlos Areces, Wiet Bouma, Maarten De Rijke

We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the...

Interpolation, definability and fixed points in interpretability logics (2000)

Carlos Areces, Eva Hoogland, Dick Jongh

abstract. In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and...

The Computational Complexity of Hybrid Temporal Logics (2000)

Carlos Areces, Enrico Franconi

In their simplest form, hybrid languages are propositional modal languages which can refer to states. They were introduced by Arthur Prior, the inventor of tense logic, and played an important role...

Use Your Logic (2000)

This paper views modal logics as languages that are especially tailored for describing relational structures. After pointing out the connections between modal logics and other elds, it describes a...

Rijke. Tree-based Heuristics in Modal Theorem Proving (2000)

Carlos Areces, Rosella Gennari, Juan Heguiabehere, Maarten De Rijke

Abstract. We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas. We...

Rijke. Feature Interaction as a Satisfiability Problem (2000)

Rijke, The guarded fragment: Ins and outs (1999)

We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the...

Carlos Areces, Christof Monz, Hans De Nivelle, Maarten De Rijke

In this short note we discuss several perspectives on the notion of Guarded Fragments (GFs) of first-order logic first introduced by Andréka, van Benthem and Németi. We focus on computational...

A road-map on complexity for hybrid logics (1999)

Rijke. Prefixed resolution: A resolution method for modal and description logics (1999)

Abstract. Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages for they...

Rijke. Spatial reasoning for image retrieval (1999)

Abstract. We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important ways. First, it avoids translations into large...

Marco Aiello, Carlos Areces, Maarten Rijke

Building upon the description logic of concrete domains introduced by Baader and Hanschke, we provide a system which is aimed at enhancing image retrieval with the ability to perform spatial...

Prefixed Resolution - A Resolution Method for Modal and Description Logics (1999)

Rijke. Towards Feature Interaction via Stable Models (1999)

. To appear in the Proceedings of CADE-16. Trento. Italy. We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important...

Rafael Accorsi, Carlos Areces, Maarten Rijke

Abstract. In this paper we propose a new approach to the problem of detecting feature interactions based on the stable models semantics for logical programs. Starting from a formal denition of a...

Hybrid Logics: Characterization, Interpolation and Complexity (1999)

A Road-map on Complexity for Hybrid Logics (1999)

Hybrid languages are expansions of propositional modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work...

Description Logics and Feature Interaction (1999)

. Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages for they...

Carlos Areces, Wiet Bouma, Maarten De Rijke

We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the...

Failure of Interpolation in Combined Modal Logics (1999)

Maarten Marx, Carlos Areces

We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation....

Hybrid Logics: Characterization, Interpolation and Complexity (1999)

Failure of Interpolation in Combined Modal Logics (1999)

Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least [Pri67], but recent work (for example [BS98,...

Maarten Marx Carlos, Carlos Areces

We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation....

Rijke, The guarded fragment: Ins and outs (1999)

Carlos Areces, Christof Monz, Hans De Nivelle, Maarten De Rijke

In this short note we discuss several perspectives on the notion of Guarded Fragments (GFs) of first-order logic first introduced by Andréka, van Benthem and Németi. We focus on computational...

Failure of Interpolation in Combined Modal Logics (1998)

Areces, Carlos, Marx, Maarten

We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation....

Failure of Interpolation in Combined Modal Logics (1998)

Maarten Marx, Carlos Areces

We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation....

Rijke. Interpolation and bisimulation in temporal logic (1998)

Carlos Areces, Maarten Rijke

Building on recent model theoretic results for Since-Until logics we define an adequate notion of bisimulation and establish general theorems concerning the interpolation property. Using these...

Expressiveness Revisited (1998)

Carlos Areces, Coventry Cv Al, Maarten De Rijke

We consider two recently proposed definitions of the expressive power of description logics, one due to Baader, the other due to Kurtonina and de Rijke. The proposals are non-equivalent, and we...

Characterization Results for d-Horn Formulas, or On formulas that are true on Dual Reduced Products (1998)

Carlos Areces, Verónica Becher, Sebastián Ferro

Appeared in Proceedings of ITALLC'98. We provide two different model theoretic characterizations of a new fragment of first-order logic which we call d-Horn formulas. This fragment is dual to...

The Interpolation Theorem for IL and ILP (1998)

Carlos Areces, Dick De Jongh, Eva Hoogland

In this article we establish interpolation for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for...

Iterable AGM Functions (1998)

Carlos Areces, Verónica Becher

Appeared in Proceedings of BR'98. Trento. Italy. The AGM model has been criticized for not addressing the problem of iterated change. This is true, but in some cases the invalid claim that...

Expressiveness Revisited (1998)

Logic, Language and (1998)

Appeared in Proceedings of DL'98. We consider two recently proposed definitions of the expressive power of description logics, one due to Baader, the other due to Kurtonina and de Rijke. The...

Computation Volume The, Carlos Areces, Ver Onica Becher, Sebasti An Ferro

this paper we identify another restriction of FO, the d-Horn fragment, that possesses the same low complexity for showing unsatis ability and has a nice model theoretic characterization: the set of...

Failure of Interpolation in Combined Modal Logics (1997)

Maarten Marx, Carlos Areces

We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation....

Controlled Model Exploration