Compilation-Based Approaches to Parallel Planning: An Empirical Comparison
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem,
Kristýna Pantůčková, Roman Barták
doaj +1 more source
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation [PDF]
, 2003 This paper identifies a generic axiom framework for prioritised fuzzy constraint satisfaction problems (PFCSPs), and proposes methods to instantiate it (i.e., to construct specific schemes which obey the generic axiom framework).
Luo, X. +14 more
core +1 more source
Preventive maintenance scheduling with integer programming and constraint programming [PDF]
مدیریت صنعتی, 2014 Preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. Mathematical models have been developed to solve the preventive maintenance scheduling problem.
Majid Esmaelian, Hajar Bakran
doaj +1 more source
Sensitive instances of the Constraint Satisfaction Problem
CoRR, 2020 We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an instance of the CSP is called sensitive, if removing any tuple from any constraining relation invalidates some ...
Barto, Libor +3 more
openaire +5 more sources
09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]
, 2010 From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Krokhin, Andrei +3 more
core +1 more source
Subsumption Algorithms for Three-Valued Geometric Resolution [PDF]
Logical Methods in Computer Science, 2018 In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation.
Hans de Nivelle
doaj +1 more source
09441 Executive Summary – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]
, 2010 The seminar brought together forty researchers from di®erent highly advanced areas of constraint satisfaction and with complementary ex- pertise (logical, algebraic, combinatorial, probabilistic aspects). The list of participants contained both senior
Krokhin, Andrei +3 more
core +1 more source
Generalized Majority-Minority Operations are Tractable [PDF]
Logical Methods in Computer Science, 2006 Generalized majority-minority (GMM) operations are introduced as a common generalization of near unanimity operations and Mal'tsev operations on finite sets.
Victor Dalmau
doaj +1 more source
Counting Constraint Satisfaction Problems [PDF]
, 2017 This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and ...
Jerrum, Mark
core +1 more source
Argumentation Frameworks as Constraint Satisfaction Problems [PDF]
Annals of Mathematics and Artificial Intelligence, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leila Amgoud, Caroline Devred
openaire +2 more sources