The Experts below are selected from a list of 22761 Experts worldwide ranked by ideXlab platform
Luc Segoufin - One of the best experts on this subject based on the ideXlab platform.
-
Expressive Power of pebbles Automata
2007Co-Authors: Mikołaj Bojańczyk, Mathias Samuelides, Thomas Schwentick, Luc SegoufinAbstract:Two variants of pebble tree-walking automata on trees are considered that were introduced in the literature. It is shown that for each number of pebbles, the two models have the same Expressive Power both in the deterministic case and in the nondeterministic case. Furthermore, nondeterministic (resp. deterministic) tree-walking automata with n + 1 pebbles can recognize more languages than those with n pebbles. Moreover, there is a regular tree language that is not recognized by any tree- walking automaton with pebbles. As a consequence, FO+posTC is strictly included in MSO over trees.
-
Expressive Power of pebble automata
Lecture Notes in Computer Science, 2006Co-Authors: Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc SegoufinAbstract:Two variants of pebble tree-walking automata on binary trees are considered that were introduced in the literature. It is shown that for each number of pebbles, the two models have the same Expressive Power both in the deterministic case and in the nondeterministic case. Furthermore, nondeterministic (resp. deterministic) tree-walking automata with n + I pebbles can recognize more languages than those with n pebbles. Moreover, there is a regular tree language that is not recognized by any tree-walking automaton with pebbles. As a consequence, FO+posTC is strictly included in MSO over trees.
Jonni Virtema - One of the best experts on this subject based on the ideXlab platform.
-
Advances in Modal Logic - The Expressive Power of Modal Dependence Logic
2020Co-Authors: Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni VirtemaAbstract:We study the Expressive Power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the Expressive Power of modal logic with intuitionistic disjunction and extended modal dependence logic coincide. Finally we establish that any translation from extended modal dependence logic into modal logic with intuitionistic disjunction increases the size of some formulas exponentially.
-
the Expressive Power of modal dependence logic
Advances in Modal Logic, 2014Co-Authors: Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni VirtemaAbstract:We study the Expressive Power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the Expressive Power of modal logic with intuitionistic disjunction and extended modal dependence logic coincide. Finally we establish that any translation from extended modal dependence logic into modal logic with intuitionistic disjunction increases the size of some formulas exponentially.
Lauri Hella - One of the best experts on this subject based on the ideXlab platform.
-
Advances in Modal Logic - The Expressive Power of Modal Dependence Logic
2020Co-Authors: Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni VirtemaAbstract:We study the Expressive Power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the Expressive Power of modal logic with intuitionistic disjunction and extended modal dependence logic coincide. Finally we establish that any translation from extended modal dependence logic into modal logic with intuitionistic disjunction increases the size of some formulas exponentially.
-
the Expressive Power of modal logic with inclusion atoms
arxiv:cs.LO, 2015Co-Authors: Lauri Hella, Johanna StumpfAbstract:Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the Expressive Power of modal inclusion logic: a class of Kripke models with teams is definable in modal inclusion logic if and only if it is closed under k-bisimulation for some integer k, it is closed under unions, and it has the empty team property. We also prove that the same Expressive Power can be obtained by adding a single unary nonemptiness operator to modal logic. Furthermore, we establish an exponential lower bound for the size of the translation from modal inclusion logic to modal logic with the nonemptiness operator.
-
the Expressive Power of modal dependence logic
Advances in Modal Logic, 2014Co-Authors: Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni VirtemaAbstract:We study the Expressive Power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the Expressive Power of modal logic with intuitionistic disjunction and extended modal dependence logic coincide. Finally we establish that any translation from extended modal dependence logic into modal logic with intuitionistic disjunction increases the size of some formulas exponentially.
Bernhard Nebel - One of the best experts on this subject based on the ideXlab platform.
-
On the Expressive Power of planning formalisms: Conditional effects and Boolean preconditions in the STRIPS formalism
2001Co-Authors: Bernhard NebelAbstract:The notion of “Expressive Power” is often used in the literature on planning. However, it is usually only used in an informal way. In this paper, we will formalize this notion using the “compilability framework” and analyze the Expressive Power of some variants of strips allowing for conditional effects and arbitrary Boolean formulae in preconditions. One interesting consequenceof this analysis is that we are able to confirm a conjecture by Backstrom that preconditions in conjunctive normal form add to the Expressive Power of propositional strips. Further, we will show that strips with conditional effects is incomparable to strips with Boolean formulae as preconditions. Finally, we show that preconditions in conjunctive normal form do not add any Expressive Power once we have conditional effects.
-
On the Expressive Power of planning formalisms
Logic-Based Artificial Intelligence, 2000Co-Authors: Bernhard NebelAbstract:The notion of "Expressive Power" is often used in the literature on Planning. However, it is usually only used in an informal way. In this paper, we will formalize this notion using the "compilability framework" and analyze the Expressive Power of some variants of STRIPS allowing for conditional effects and arbitrary Boolean formulae in preconditions. One interesting consequence of this analysis is that we are able to confirm a conjecture by Backstrom that preconditions in conjunctive normal form add to the Expressive Power of propositional STRIPS. Further, we will show that STRIPS with conditional effects is incomparable to STRIPS with Boolean formulae as preconditions. Finally, we show that preconditions in conjunctive normal form do not add any Expressive Power once we have conditional effects.
-
ECP - What Is the Expressive Power of Disjunctive Preconditions
Lecture Notes in Computer Science, 1999Co-Authors: Bernhard NebelAbstract:While there seems to be a general consensus about the Expressive Power of a number of language features in planning formalisms, one can find many different statements about the Expressive Power of disjunctive preconditions. Using the “compilability framework,” we show that preconditions in conjunctive normal form add to the Expressive Power of propositional strips, which confirms a conjecture by Backstrom. Further, we show that preconditions in conjunctive normal form do not add any Expressive Power once we have conditional effects.
-
KI - Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms
Lecture Notes in Computer Science, 1999Co-Authors: Bernhard NebelAbstract:The recent approaches of extending the graphplan algorithm to handle more Expressive planning formalisms raise the question of what the formal meaning of "Expressive Power" is. We formalize the intuition that Expressive Power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of "compilation schemes" between planning formalisms. Using this notion, we analyze the Expressive Power of a large family of propositional planning formalisms and show, e.g., that Gazen and Kno-block's approach to compiling conditional effects away is optimal.
Claudio Gutierrez - One of the best experts on this subject based on the ideXlab platform.
-
the Expressive Power of sparql
International Semantic Web Conference, 2008Co-Authors: Renzo Angles, Claudio GutierrezAbstract:This paper studies the Expressive Power of SPARQL. The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent Expressive Power, and hence, by classical results, SPARQL is equivalent from an Expressiveness point of view to Relational Algebra. We present explicit generic rules of the transformations in both directions. Among other findings of the paper are the proof that negation can be simulated in SPARQL, that non-safe filters are superfluous, and that current SPARQL W3C semantics can be simplified to a standard compositional one.
-
International Semantic Web Conference - The Expressive Power of SPARQL
Lecture Notes in Computer Science, 2008Co-Authors: Renzo Angles, Claudio GutierrezAbstract:This paper studies the Expressive Power of SPARQL. The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent Expressive Power, and hence, by classical results, SPARQL is equivalent from an Expressiveness point of view to Relational Algebra. We present explicit generic rules of the transformations in both directions. Among other findings of the paper are the proof that negation can be simulated in SPARQL, that non-safe filters are superfluous, and that current SPARQL W3C semantics can be simplified to a standard compositional one.
