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

DOI10.1145/2460239.2460243MaRDI QIDQ5276108zbMATH OpenOpenAlexWikidataFDO

Authors Davide Bresolin, G. Sánchez, Guido Sciavicco, Fernando Jiménez

Publication date 14 July 2017

Published in Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2460239.2460243

zbMATH Keywords

evolutionary algorithmsfinite satisfiabilitymodal logictemporal logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Finite satisfiability of interval temporal logic formulas with multi-objective metaheuristics
• An optimal decision procedure for right propositional neighborhood logic
• A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
• Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
• Interval temporal logics over finite linear orders: the complete picture

Cited in

(1)

• Finite satisfiability of interval temporal logic formulas with multi-objective metaheuristics

This page was built for publication: Finite satisfiability of propositional interval logic formulas with multi-objective evolutionary algorithms

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