Finite satisfiability of propositional interval logic formulas with multi-objective evolutionary algorithms

Authors:
Davide Bresolin;Fernando Jiménez;Gracia Sánchez;Guido Sciavicco
Affiliations:
University of Verona, Verona, Italy;University of Murcia, Murcia, Spain;University of Murcia, Murcia, Spain;University of Murcia, Murcia, Spain
Venue:
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Year:
2013

Citing 13
Cited 0

An adaptive evolutionary algorithm for the satisfiability problem

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
SAT-Based Decision Procedures for Classical Modal Logics

Journal of Automated Reasoning
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
An Optimal Decision Procedure for Right Propositional Neighborhood Logic

Journal of Automated Reasoning
Improving interpretability in approximative fuzzy models via multiobjective evolutionary algorithms: Research Articles

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

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A new general method to generate random modal formulae for testing decision procedures

Journal of Artificial Intelligence Research
Evolutionary computing for the satisfiability problem

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
An evolutionary local search algorithm for the satisfiability problem

TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. Despite being relevant for a broad spectrum of application domains, ranging from temporal databases to artificial intelligence and verification of reactive systems, interval temporal logics still misses algorithms and tools capable of supporting them in an efficient way. In this paper, we approach the finite satisfiability problem for the simplest meaningful interval temporal logic (which is NEXPTIME-complete), namely A (also known as Right Propositional Neighborhood Logic), by means of a multi-objective combinatorial optimization model solved with three different multi-objective evolutionary algorithms. As a result we obtain a decision procedure that, although incomplete, turns out to be unexpectedly suitable and easy to implement with respect to classical complete algorithms. Moreover, this approach allows one to effectively search for the minimal model that satisfy a set of A-formulas without using any kind of normal form.