Search Results - "Zakharyaschev, M"
-
1
The DL-Lite Family and Relations
Published in The Journal of artificial intelligence research (01-01-2009)“…The recently introduced series of description logics under the common moniker `DL-Lite' has attracted attention of the description logic and semantic web…”
Get full text
Journal Article -
2
A Decidable Extension of SROIQ with Complex Role Chains and Unions
Published in The Journal of artificial intelligence research (01-01-2013)“…We design a decidable extension of the description logic SROIQ underlying the Web Ontology Language OWL 2. The new logic, called SR+OIQ, supports a controlled…”
Get full text
Journal Article -
3
Combining Spatial and Temporal Logics: Expressiveness vs. Complexity
Published in The Journal of artificial intelligence research (01-01-2005)“…In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and…”
Get full text
Journal Article -
4
A Logic for Concepts and Similarity
Published in Journal of logic and computation (01-06-2007)“…Categorization of objects into classes is currently supported by (at least) two `orthogonal' methods. In logic-based approaches, classifications are defined…”
Get full text
Journal Article -
5
Products of ‘transitive” modal logics
Published in The Journal of symbolic logic (01-09-2005)“…We solve a major open problem concerning algorithmic properties of products of 'transitive' modal logics by showing that products and commutators of such…”
Get full text
Journal Article -
6
Decidable and undecidable fragments of first-order branching temporal logics
Published in Proceedings - Symposium on Logic in Computer Science (2002)“…In this paper we analyze the decision problem for fragments of first-order extensions of branching time temporal logics such as computational tree logics CTL…”
Get full text
Conference Proceeding Journal Article -
7
On the computational complexity of decidable fragments of first-order linear temporal logics
Published in 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings (2003)“…We study the complexity of some fragments of first-order temporal logic over natural numbers time. The one-variable fragment of linear first-order temporal…”
Get full text
Conference Proceeding -
8
On non-local propositional and local one-variable quantified CTL
Published in Proceedings Ninth International Symposium on Temporal Representation and Reasoning (2002)“…We prove decidability of 'non local' propositional CTL*, where truth values of atoms may depend on the branch of evaluation. This result is then used to show…”
Get full text
Conference Proceeding -
9
Temporalising Tractable Description Logics
Published in 14th International Symposium on Temporal Representation and Reasoning (TIME'07) (01-06-2007)“…It is known that for temporal languages, such as first-order LTL, reasoning about constant (time-independent) relations is almost always undecidable. This…”
Get full text
Conference Proceeding -
10
Decidable fragments of first-order temporal logics
Published in Annals of pure and applied logic (01-12-2000)“…In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal…”
Get full text
Journal Article -
11
Non-primitive recursive decidability of products of modal logics with expanding domains
Published in Annals of pure and applied logic (01-10-2006)“…We show that—unlike products of ‘transitive’ modal logics which are usually undecidable—their ‘expanding domain’ relativisations can be decidable, though not…”
Get full text
Journal Article -
12
Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning
Published in Applied intelligence (Dordrecht, Netherlands) (01-11-2002)“…In this paper we advocate the use of multi-dimensional modal logics as a framework for knowledge representation and, in particular, for representing…”
Get full text
Journal Article -
13
Axiomatizing the monodic fragment of first-order temporal logic
Published in Annals of pure and applied logic (01-12-2002)“…It is known that even seemingly small fragments of the first-order temporal logic over the natural numbers are not recursively enumerable. In this paper we…”
Get full text
Journal Article -
14
On Dynamic Topological and Metric Logics
Published in Studia logica (30-10-2006)“…We investigate computational properties of propositional logics for dynamical systems. First, we consider logics for dynamic topological systems$\langle…”
Get full text
Journal Article -
15
Willem Blok and Modal Logic
Published in Studia logica (01-06-2006)“…We present our personal view on W. J. Blok's contribution to modal logic…”
Get full text
Journal Article -
16
Decidable fragments of first-order modal logics
Published in The Journal of symbolic logic (01-09-2001)“…The paper considers the set ML1 of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable…”
Get full text
Journal Article -
17
A logic for metric and topology
Published in The Journal of symbolic logic (01-09-2005)“…We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with…”
Get full text
Journal Article -
18
On the Products of Linear Modal Logics
Published in Journal of logic and computation (01-12-2001)“…We study two‐dimensional Cartesian products of modal logics determined by infinite or arbitrarily long finite linear orders and prove a general theorem showing…”
Get full text
Journal Article -
19
Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
Published in The bulletin of symbolic logic (01-09-2005)“…We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the…”
Get full text
Journal Article -
20
On Non-local Propositional and Weak Monodic Quantified CTL
Published in Journal of logic and computation (01-02-2004)“…In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional PCTL*, in which…”
Get full text
Journal Article