What is modal logic

Alternating-time temporal logic

Invited Lectures.- Tableau Algorithms for Description Logics.- Modality and Databases.- Local Symmetries in Propositional Logic.- Comparison.- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison.- Consistency Testing: The RACE Experience.- Benchmark Analysis with FaCT.- MSPASS: Modal Reasoning by Translation and First-Order Resolution.- TANCS-2000 Results for DLP.- Evaluating *SAT on TANCS 2000 Benchmarks.- Research Papers.- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations.- A Tableau System for Godel-Dummett Logic Based on a Hypersequent Calculus.- An Analytic Calculus for Quantified Propositional Godel Logic.- A Tableau Method for Inconsistency-Adaptive Logics.- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning.- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics.- Variants of First-Order Modal Logics.- Complexity of Simple Dependent Bimodal Logics.- Properties of Embeddings from Int to S4.- Term-Modal Logics.- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics.- Dual Intuitionistic Logic Revisited.- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions.- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints.- Matrix-Based Inductive Theorem Proving.- Monotonic Preorders for Free Variable Tableaux.- The Mosaic Method for Temporal Logics.- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5.- A Tableau Calculus for Equilibrium Entailment.- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.- Tableau Calculus for Only Knowing and Knowing At Most.- A Tableau-Like Representation Framework for Efficient Proof Reconstruction.- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q.- System Descriptions.- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO.- E-SETHEO: An Automated3 Theorem Prover.

Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings

Binary differential evolution with self-learning for multi-objective feature selection

The Knowledge Engineering Review

We survey main developments, results, and open problems on interval temporal logics and duration calculi We present various formal systems studied in the literature and discuss their distinctive f

/pdf/a-road-map-of-interval-temporal-logics-and-duration-calculi-47yzr2kd4k.pdf

A Road Map of Interval Temporal Logics and Duration Calculi

Multi-objective evolutionary feature selection for online sales forecasting

https://www2.philosophy.su.se/goranko/papers/APAL-Propositional%20interval%20neighborhood%20logics%20Expressiveness,%20decidability,%20and%20undecidable%20extensions%20-%20final%20draft%20090610.pdf

Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions

Logics for time intervals provide a natural framework for dealing with time in various areas of computer science and artificial intelligence, such as planning, natu- ral language processing, temporal databases, and formal specification. In this paper we focus our attention on propositional interval temporal logics with temporal modalities for neighboring intervals over linear orders. We study the class of propositional neigh- borhood logics (PNL) over two natural semantics, respectively admitting and exclud- ing point-intervals. First, we introduce interval neighborhood frames and we provide representation theorems for them; then, we develop complete axiomatic systems and semantic tableaux for logics in PNL.

/pdf/propositional-interval-neighborhood-temporal-logics-uwmswlvcrg.pdf

Propositional Interval Neighborhood Temporal Logics

Interval temporal logics are based on temporal structures where time intervals, rather than time instants, are the primitive ontological entities. They employ modal operators corresponding to various relations between intervals, known as Allen's relations. Technically, validity in interval temporal logics translates to dyadic second-order logic, thus explaining their complex computational behavior. The full modal logic of Allen's relations, called HS, has been proved to be undecidable by Halpern and Shoham under very weak assumptions on the class of interval structures, and this result was discouraging attempts for practical applications and further research in the field. A renewed interest has been recently stimulated by the discovery of interesting decidable fragments of HS. This paper contributes to the characterization of the boundary between decidability and undecidability of HS fragments. It summarizes known positive and negative results, it describes the main techniques applied so far in both directions, and it establishes a number of new undecidability results for relatively small fragments of HS.

Guido Sciavicco

Papers

A Road Map of Interval Temporal Logics and Duration Calculi

Multi-objective evolutionary feature selection for online sales forecasting

Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions

Propositional Interval Neighborhood Temporal Logics

Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification