Decidability and Undecidability Results for Propositional Schemata
نویسندگان
چکیده
منابع مشابه
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧n i=1 pi, where n is a parameter). The satisfiability problem is shown to be undecidable for this new logic, but we introduce a very general class of schemata, called b...
متن کاملMetric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entities and truth of formulae is defined relative to time intervals, rather than time instants. In this paper, we introduce and study Metric Propositional Neighborhood Logic (MPNL) over natural numbers. MPNL features two modalities r...
متن کاملDecidability and Undecidability Results for Planning with Numerical State Variables
These days, propositional planning can be considered a quite well-understood problem. Good algorithms are known that can solve a wealth of very different and sometimes challenging planning tasks, and theoretical computational properties of both general STRIPS-style planning and the best-known benchmark problems have been established. However, propositional planning has a major drawback: The for...
متن کاملComplexity, Decidability and Undecidability Results for Domain-Independent Planning
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is decidable and undecidable. Our results on this topic solve an open problem posed by Chapman [5], and clear up some difficulties with his undecidability theorems. For those cases where planning is decid...
متن کاملMonadic Fragments of Gödel Logics: Decidability and Undecidability Results
The monadic fragments of first-order Gödel logics are investigated. It is shown that all finite-valued monadic Gödel logics are decidable; whereas, with the possible exception of one (G↑), all infinitevalued monadic Gödel logics are undecidable. For the missing case G↑ the decidability of an important sub-case, that is well motivated also from an application oriented point of view, is proven. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2011
ISSN: 1076-9757
DOI: 10.1613/jair.3351