8 research outputs found
PDL with Intersection and Converse is 2EXP-complete
The logic ICPDL is the expressive extension of Propositional
Dynamic Logic (PDL), which admits intersection and converse
as program operators.
The result of this paper is containment
of ICPDL-satisfiability in EXP, which improves the
previously known non-elementary upper bound and implies
EXP-completeness due to an existing lower bound for PDL with intersection (IPDL). The proof proceeds showing that every satisfiable ICPDL formula has model of tree width at most two. Next, we reduce satisfiability in ICPDL to -regular tree satisfiability in ICPDL. In the latter problem the set of possible models is restricted to trees of an -regular tree language. In the final step,-regular tree satisfiability is reduced the emptiness
problem for alternating two-way automata on infinite trees. In this way, a more elegant proof is obtained for Danecki\u27s difficult result that satisfiability in IPDL is in
Formal reasoning with rough sets in multiple-source approximation systems
AbstractWe focus on families of Pawlak approximation spaces, called multiple-source approximation systems (MSASs). These reflect the situation where information arrives from multiple sources. The behaviour of rough sets in MSASs is investigated – different notions of lower and upper approximations, and definability of a set in a MSAS are introduced. In this context, a generalized version of an information system, viz. multiple-source knowledge representation (KR)-system, is discussed. Apart from the indiscernibility relation which can be defined on a multiple-source KR-system, two other relations, viz. similarity and inclusion are considered. To facilitate formal reasoning with rough sets in MSASs, a quantified propositional modal logic LMSAS is proposed. Interpretations for sets of well-formed formulae (wffs) of LMSAS are defined on MSASs, and the various properties of rough sets in MSASs translate into logically valid wffs of the system. LMSAS is shown to be sound and complete with respect to this semantics. Some decidable problems are addressed. In particular, it is shown that for any LMSAS-wff α, it is possible to check whether α is satisfiable in a certain class of interpretations with MSASs of a given finite cardinality. Moreover, it is also decidable whether any wff α is satisfiable in the class of all interpretations with MSASs having domain of a given finite cardinality
Weighted logics for artificial intelligence : an introductory discussion
International audienceBefore presenting the contents of the special issue, we propose a structured introductory overview of a landscape of the weighted logics (in a general sense) that can be found in the Artificial Intelligence literature, highlighting their fundamental differences and their application areas
Three-valued logics, uncertainty management and rough sets
This paper is a survey of the connections between three-valued logics and rough sets from the point of view of incomplete information management. Based on the fact that many three-valued logics can be put under a unique algebraic umbrella, we show how to translate three-valued conjunctions and implications into operations on ill-known sets such as rough sets. We then show that while such translations may provide mathematically elegant algebraic settings for rough sets, the interpretability of these connectives in terms of an original set approximated via an equivalence relation is very limited, thus casting doubts on the practical relevance of truth-functional logical renderings of rough sets
Reasoning about reversal-bounded counter machines
International audienceIn this paper, we present a short survey on reversal-bounded counter machines. It focuses on the main techniques for model-checking such counter machines with specifications expressed with formulae from some linear-time temporal logic. All the decision procedures are designed by translation into Presburger arithmetic. We provide a proof that is alternative to Ibarra's original one for showing that reachability sets are effectively definable in Presburger arithmetic. Extensions to repeated control state reachability and to additional temporal properties are discussed in the paper. The article is written to the honor of Professor Ewa Orłowska and focuses on several topics that are developped in her works