# On the consistency of context-aware systems

@article{Limn2018OnTC,
title={On the consistency of context-aware systems},
author={Yensen Lim{\'o}n and E. B{\'a}rcenas and E. Ben{\'i}tez-Guerrero and G. Molero},
journal={J. Intell. Fuzzy Syst.},
year={2018},
volume={34},
pages={3373-3383}
}

#### Topics from this paper

Sobre la automatización del razonamiento y el aprendizaje en lógicas modales
• Computer Science
• Res. Comput. Sci.
• 2020
The study of machine learning techniques in the context of automated reasoning in modal logics, a family of formal languages widely used in many domains of computer science, is proposed. Expand
Consistency checking of attention aware systems
• Computer Science
• LANMR
• 2019
This work study a formal notion of consistency in attention aware systems for the educational setting, and proposes an expressive modal logic as specification language, and a consistency checking algorithm defined in terms of the satisfiability problem of the logic. Expand
Mu-Calculus Satisfiability with Arithmetic Constraints
• Computer Science
• Program. Comput. Softw.
• 2020
A Satisfiability Algorithm For The Mu-Calculus For Trees With Presburger Constraints
• Computer Science
• 2019 7th International Conference in Software Engineering Research and Innovation (CONISOFT)
• 2019
A satisfiability algorithm for the $\mu-$calculus interpreted on tree models and extended with converse modalities and Presburger arithmetic operators, based on a breadth-first search in a Fischer-Lardner construction of tree models is described. Expand
Expressive Context Modeling with Description Logics
• Computer Science
• KGSWC
• 2019
This work proposes the use of an expressive description logics to model the consistency of context-aware systems and shows this expressive modeling language is capable to succinctly express complex properties, such as temporal ones. Expand

#### References

SHOWING 1-5 OF 5 REFERENCES
Depth-First Reasoning on Trees
• Computer Science
• Computación y Sistemas
• 2018
This paper proposes a satisfiability algorithm for the mu-calculus extended with converse modalities and interpreted on unranked trees based on a depth-first search and proves the algorithm to be correct (sound and complete) and optimal. Expand
A formal framework for context-aware systems specification and verification
• Computer Science
• J. Syst. Softw.
• 2016
This paper designs a framework that promotes the ability to specify and verify context-aware systems to assist and facilitate designer's task and defines a formal semantics to overcome these drawbacks. Expand
Reasoning on expressive description logics with arithmetic constraints
• Mathematics, Computer Science
• 2016 International Conference on Electronics, Communications and Computers (CONIELECOMP)
• 2016
It is shown that μALCTIO, which is known to be undecidable and that subsumes ALCQIOreg, is inEXPTIME in the case of tree models, and that knowledge base reasoning, TBoxes and ABoxes, can also be decided in EXPTIME. Expand
OWL 2 modeling and reasoning with complex human activities
• Computer Science
• Pervasive Mob. Comput.
• 2011
This paper investigates the use of OWL 2 for modeling complex activities and reasoning with them and proposes a system architecture showing the integration of a novel OWL2 activity ontology and reasoning modules with distributed modules for sensor data aggregation and reasoning. Expand
On location models for ubiquitous computing
• Computer Science
• Personal and Ubiquitous Computing
• 2004
An overview of existing location models allowing for position, range, and nearest neighbor queries is presented and the classification of location models with respect to application requirements can assist developers in their design decisions. Expand