Logic of temporal attribute implications

DOI10.1007/S10472-016-9526-6MaRDI QIDQ2364366zbMATH OpenOpenAlexFDO

Authors Jan Triska, Vilem Vychodil

Publication date 19 July 2017

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.3633

zbMATH Keywords

fixed pointcomplete axiomatizationfunctional dependencyattribute implicationtemporal semanticsentailment problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Abstract: 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.

Recommendations

• Minimal bases of temporal attribute implications
• A logic of graded attributes
• Derivation digraphs for dependencies in ordinal and similarity-based data
• scientific article; zbMATH DE number 4127179
• Relative entailment among probabilistic implications

Cites work

• scientific article; zbMATH DE number 6003856 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 53099 (Why is no real title available?)
• scientific article; zbMATH DE number 89002 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1204307 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1458810 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 877297 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A lattice-theoretical fixpoint theorem and its applications
• A relation-algebraic approach to the ``Hoare logic of functional dependencies
• A relational model of data for large shared data banks
• Characterizing functional dependencies in formal concept analysis with pattern structures
• Conceptual Structures at Work
• Detection and exploitation of functional dependencies for model generation
• Extending inclusion dependencies with conditions
• Functional Dependencies in a Relational Database and Propositional Logic
• Inter-transactional association rules for multi-dimensional contexts for prediction and their application to studying meteorological data
• Interval-based temporal functional dependencies: specification and verification
• Logic of temporal attribute implications
• Logical foundations for more expressive declarative temporal logic programming languages
• Metamathematics of fuzzy logic
• Modal logic
• Non-deterministic ideal operators: an adequate tool for formalization in data bases
• On a generalization of quantifiers
• On functional dependencies in q-Horn theories
• Reasoning about functional and full hierarchical dependencies over partial relations
• Reasoning about time in the situation calculus
• The complexity of clausal fragments of LTL
• The implication problem for `closest node' functional dependencies in complete XML documents
• Two basic algorithms in concept analysis
• Wiener structure based modeling and identifying of soft sensor systems

Cited in

(6)

• Time-stamped claim logic
• Minimal bases of temporal attribute implications
• Restricted ideals and the groupability property. Tools for temporal reasoning.
• Logic of temporal attribute implications
• Closure structures parameterized by systems of isotone Galois connections
• Evolution of objects and concepts

Describes a project that uses

Uses Software

• PDDL

This page was built for publication: Logic of temporal attribute implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364366)