Logic of temporal attribute implications

12/11/2014
by   Jan Triska, et al.
0

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point characterization, investigate closure properties of model classes, present an axiomatization and prove its completeness, and investigate alternative axiomatizations and normalized proofs. We investigate decidability and complexity issues of the logic and prove that the entailment problem is NP-hard and belongs to EXPSPACE. We show that by restricting to predictive formulas, the entailment problem is decidable in pseudo-linear time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2014

Fuzzy inequational logic

We present a logic for reasoning about graded inequalities which general...
research
04/27/2020

Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs

We propose a graph-based extension of Boolean logic called Boolean Graph...
research
03/08/2018

On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)

We investigate the complexity consequences of adding pointer arithmetic ...
research
02/01/2021

The Complexity of Learning Linear Temporal Formulas from Examples

In this paper we initiate the study of the computational complexity of l...
research
06/19/2022

Two Results on Separation Logic With Theory Reasoning

Two results are presented concerning the entailment problem in Separatio...
research
08/29/2021

An Upper Bound for Provenance in ELHr

We investigate the entailment problem in ELHr ontologies annotated with ...
research
06/20/2017

The Complexity of Campaigning

In "The Logic of Campaigning", Dean and Parikh consider a candidate maki...

Please sign up or login with your details

Forgot password? Click here to reset