Sciweavers

156 search results - page 6 / 32
» Decidability and Undecidability in Probability Logic
Sort
View
DLOG
2010
13 years 5 months ago
Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
Chan Le Duc, Myriam Lamolle
FOSSACS
2006
Springer
13 years 11 months ago
On Metric Temporal Logic and Faulty Turing Machines
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
Joël Ouaknine, James Worrell
FORMATS
2007
Springer
14 years 1 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 7 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 2 months ago
A Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Ou...