629 research outputs found
On the Decidability of a Fragment of preferential LTL
Linear Temporal Logic (LTL) has found extensive applications in Computer Science and Artificial Intelligence, notably as a formal framework for representing and verifying computer systems that vary over time. Non-monotonic reasoning, on the other hand, allows us to formalize and reason with exceptions and the dynamics of information. The goal of this paper is therefore to enrich temporal formalisms with non-monotonic reasoning features. We do so by investigating a preferential semantics for defeasible LTL along the lines of that extensively studied by Kraus et al. in the propositional case and recently extended to modal and description logics. The main contribution of the paper is a decidability result for a meaningful fragment of preferential LTL that can serve as the basis for further exploration of defeasibility in temporal formalisms
Conditionals and modularity in general logics
In this work in progress, we discuss independence and interpolation and
related topics for classical, modal, and non-monotonic logics
Reactive preferential structures and nonmonotonic consequence
We introduce information bearing systems (IBRS) as an abstraction of many
logical systems. We define a general semantics for IBRS, and show that IBRS
generalize in a natural way preferential semantics and solve open
representation problems
- …