Characterizing finite Kripke structures in propositional temporal logic
نویسندگان
چکیده
منابع مشابه
A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic
We extend the usual notion of Kripke Structures with a weighted transition relation, and generalize the usual Boolean satisfaction relation of CTL to a map which assigns to states and temporal formulae a real-valued distance describing the degree of satisfaction. We describe a general approach to obtaining quantitative interpretations for a generic extension of the CTL syntax, and show that, fo...
متن کاملA Remark on Propositional Kripke Frames Sound for Intuitionistic Logic
Usually, in the Kripke semantics for intuitionistic propositional logic (or for superintuitionistic logics) partially ordered frames are used. Why? In this paper we propose an intrinsically intuitionistic motivation for that. Namely, we show that every Kripke frame (with an arbitrary accessibility relation), whose set of valid formulas is a superintuitionistic logic, is logically equivalent to ...
متن کاملExploiting Dynamically Propositional Logic Structures in SAT
The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that arises in combining two circuits computing the hidden weighted bit function. Since 2002, it remains still unsolvable in every SAT competition. This paper focuses on solving problems such as hwb-n32. Generally speaking, modern solvers can detect only XOR, AND, OR and ITE gates. Other non-clausal formulas (propositional ...
متن کاملPropositional Scopes in Linear Temporal Logic
In this paper, we address the problem of specifying a property in LTL over a subset of the states of a system under test, ignoring the rest of the states. A modern LTL semantics that applies for both finite and infinite traces is considered. We introduce specialized operators (syntax and semantic) that help specifying properties over propositional scopes, where each scope constitute a subset of...
متن کاملTemporal Reasoning in Propositional Interval Neighborhood Logic
Interval-based temporal reasoning is an important field of various areas of Computer Science and Artificial Intelligence, such as planning and natural language processing. In this paper we show that the satisfiability problem for one of the most important formalisms for interval-based reasoning, namely Allen’s Interval Algebra, can be reduced to the satisfiability problem for Propositional Neig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90098-9