Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
In this paper, we investigate the expressiveness of the variety of propositional interval
neighborhood logics (PNL), we establish their decidability on linearly ordered domains and …
neighborhood logics (PNL), we establish their decidability on linearly ordered domains and …
An optimal decision procedure for right propositional neighborhood logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to
naturally express statements that refer to time intervals. Unfortunately, most such logics turn …
naturally express statements that refer to time intervals. Unfortunately, most such logics turn …
The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
Decidability and complexity of the satisfiability problem for the logics of time intervals have
been extensively studied in the recent years. Even though most interval logics turn out to be …
been extensively studied in the recent years. Even though most interval logics turn out to be …
An optimal tableau-based decision algorithm for Propositional Neighborhood Logic
In this paper we focus our attention on the decision problem for Propositional Neighborhood
Logic (PNL for short). PNL is the proper subset of Halpern and Shoham's modal logic of …
Logic (PNL for short). PNL is the proper subset of Halpern and Shoham's modal logic of …
Integrating the additive seasonal model and super-SBM model to compute the efficiency of port logistics companies in Vietnam
The growing trade process is pushing the importing and exporting ratio of products at ports
in Vietnam. The total amount of goods is determined by analyzing the effectiveness of …
in Vietnam. The total amount of goods is determined by analyzing the effectiveness of …
Non-finite axiomatizability and undecidability of interval temporal logics with C, D, and T
I Hodkinson, A Montanari, G Sciavicco - Computer Science Logic: 22nd …, 2008 - Springer
Interval logics are an important area of computer science. Although attention has been
mainly focused on unary operators, an early work by Venema (1991) introduced an …
mainly focused on unary operators, an early work by Venema (1991) introduced an …
[HTML][HTML] Computational complexity of hybrid interval temporal logics
PA Wałęga - Annals of Pure and Applied Logic, 2023 - Elsevier
Interval logics are very expressive temporal formalisms, but reasoning with them is often
undecidable or has high computational complexity. As a result, a vast number of approaches …
undecidable or has high computational complexity. As a result, a vast number of approaches …
Integrating the EBM Model and LTS (A, A, A) Model to Evaluate the Efficiency in the Supply Chain of Packaging Industry in Vietnam
CN Wang, QN Hoang, TKL Nguyen - Axioms, 2021 - mdpi.com
In recent decades, Vietnamese labeling and packaging has been widely recognized as
being one of the fastest developing industries in Vietnam, supported by the tremendous …
being one of the fastest developing industries in Vietnam, supported by the tremendous …
Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders
In this paper, we focus our attention on tableau systems for the propositional interval logic of
temporal neighborhood (Propositional Neighborhood Logic, PNL for short). PNL is the …
temporal neighborhood (Propositional Neighborhood Logic, PNL for short). PNL is the …
On decidability and expressiveness of propositional interval neighborhood logics
Interval-based temporal logics are an important research area in computer science and
artificial intelligence. In this paper we investigate decidability and expressiveness issues for …
artificial intelligence. In this paper we investigate decidability and expressiveness issues for …