Search results for "QCSP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
166	Peter Nightingale	Non-binary quantified CSP: algorithms and modelling.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	QCSP, Quantified constraints, Reasoning algorithm, Modelling, Propagation algorithm
105	Guillaume Verger, Christian Bessiere	Guiding Search in QCSP+ with Back-Propagation.	CP	2008	DBLP DOI BibTeX RDF
95	Hubie Chen	Quantified Constraint Satisfaction and the Polynomially Generated Powers Property.	ICALP (2)	2008	DBLP DOI BibTeX RDF
86	Fahiem Bacchus, Kostas Stergiou 0001	Solution Directed Backjumping for QCSP.	CP	2007	DBLP DOI BibTeX RDF
76	Hubie Chen, Florent R. Madelaine, Barnaby Martin	Quantified Constraints and Containment Problems.	LICS	2008	DBLP DOI BibTeX RDF
76	Hubie Chen	Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.	CP	2004	DBLP DOI BibTeX RDF
57	David Stynes, Kenneth N. Brown	Value ordering for quantified CSPs.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	Value ordering, Quantified CSPs, Backtracking search
57	Witold Charatonik, Michal Wrona	Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates.	LPAR	2008	DBLP DOI BibTeX RDF
57	Alex Ferguson, Barry O'Sullivan	Relaxations and Explanations for Quantified Constraint Satisfaction Problems.	CP	2006	DBLP DOI BibTeX RDF
57	Guillaume Verger, Christian Bessiere	: A Bottom-Up Approach for Solving Quantified CSPs.	CP	2006	DBLP DOI BibTeX RDF
57	Kostas Stergiou 0001	Repair-Based Methods for Quantified CSPs.	CP	2005	DBLP DOI BibTeX RDF
57	Hubie Chen, Víctor Dalmau	From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.	CSL	2005	DBLP DOI BibTeX RDF
48	Marco Benedetti, Arnaud Lallouet, Jérémie Vautard	Modeling adversary scheduling with QCSP+.	SAC	2008	DBLP DOI BibTeX RDF
38	Alexandre Goldsztejn, Claude Michel, Michel Rueher	Efficient handling of universally quantified inequalities.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	Universally quantified inequalities, Branch and bound, Interval analysis
38	Witold Charatonik, Michal Wrona	Quantified Positive Temporal Constraints.	CSL	2008	DBLP DOI BibTeX RDF
38	Cédric Pralet, Thomas Schiex, Gérard Verfaillie	Decomposition of Multi-operator Queries on Semiring-Based Graphical Models.	CP	2006	DBLP DOI BibTeX RDF
38	Manuel Bodirsky, Hubie Chen	Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.	CSL	2006	DBLP DOI BibTeX RDF
38	Hubie Chen	Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms.	STACS	2005	DBLP DOI BibTeX RDF
38	Ryan Williams 0001	Algorithms for quantified Boolean formulas.	SODA	2002	DBLP BibTeX RDF
33	Marco Benedetti, Arnaud Lallouet, Jérémie Vautard	Reusing CSP Propagators for QCSPs.	CSCLP	2006	DBLP DOI BibTeX RDF	QCSP, Quantified Languages
29	Camille Monière, Bertrand Le Gal, Emmanuel Boutillon	Real-time energy-efficient software and hardware implementations of a QCSP communication system.	J. Syst. Archit.	2023	DBLP DOI BibTeX RDF
29	Kassem Saied, Luis Camacho, Emmanuel Boutillon	Weighted Coherent Detection of QCSP frames.	WCNC	2023	DBLP DOI BibTeX RDF
29	Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný	QCSP on Reflexive Tournaments.	ACM Trans. Comput. Log.	2022	DBLP DOI BibTeX RDF
29	Dmitriy Zhuk, Barnaby Martin	QCSP Monsters and the Demise of the Chen Conjecture.	J. ACM	2022	DBLP DOI BibTeX RDF
29	Camille Monière, Bertrand Le Gal, Emmanuel Boutillon	Efficient Software and Hardware Implementations of a QCSP Communication System.	DASIP	2022	DBLP DOI BibTeX RDF
29	Kassem Saied	Quasi-Cyclic Short Packet (QCSP) Transmission for IoT. (Implémentations, outils et applications émergentes pour la radio logicielle).		2022	RDF
29	Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný	QCSP on Reflexive Tournaments.	CoRR	2021	DBLP BibTeX RDF
29	Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný	QCSP on Reflexive Tournaments.	ESA	2021	DBLP DOI BibTeX RDF
29	Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler	Treewidth-Aware Quantifier Elimination and Expansion for QCSP.	CP	2020	DBLP DOI BibTeX RDF
29	Dmitriy Zhuk, Barnaby Martin	QCSP monsters and the demise of the chen conjecture.	STOC	2020	DBLP DOI BibTeX RDF
29	Dmitriy Zhuk, Barnaby Martin	QCSP monsters and the demise of the Chen Conjecture.	CoRR	2019	DBLP BibTeX RDF
29	Petar Dapic, Petar Markovic, Barnaby Martin	QCSP on Semicomplete Digraphs.	ICALP (1)	2014	DBLP DOI BibTeX RDF
29	Vincent Barichard, Igor Stéphan	The Cut Tool for QCSP.	ICTAI	2014	DBLP DOI BibTeX RDF
29	Igor Stéphan	Compilation for QCSP.	CoRR	2013	DBLP BibTeX RDF
29	Florent R. Madelaine, Barnaby Martin	QCSP on partially reflexive cycles - the wavy line of tractability	CoRR	2013	DBLP BibTeX RDF
29	Florent R. Madelaine, Barnaby Martin	QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability.	CSR	2013	DBLP DOI BibTeX RDF
29	Ji-Wei Jin, Feifei Ma, Jian Zhang 0001	Integrating Standard Dependency Schemes in QCSP Solvers.	J. Comput. Sci. Technol.	2012	DBLP DOI BibTeX RDF
29	Florent R. Madelaine, Barnaby Martin	Containment, Equivalence and Coreness from CSP to QCSP and beyond	CoRR	2012	DBLP BibTeX RDF
29	Florent R. Madelaine, Barnaby Martin	Containment, Equivalence and Coreness from CSP to QCSP and Beyond.	CP	2012	DBLP DOI BibTeX RDF
29	Barnaby Martin	QCSP on partially reflexive forests	CoRR	2011	DBLP BibTeX RDF
29	Cédric Pralet, Gérard Verfaillie	Beyond QCSP for Solving Control Problems.	CP	2011	DBLP DOI BibTeX RDF
29	Barnaby Martin	QCSP on Partially Reflexive Forests.	CP	2011	DBLP DOI BibTeX RDF
29	Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons 0001, Andrei A. Krokhin	The complexity of constraint satisfaction games and QCSP.	Inf. Comput.	2009	DBLP DOI BibTeX RDF
29	Marco Benedetti, Arnaud Lallouet, Jérémie Vautard	QCSP Made Practical by Virtue of Restricted Quantification.	IJCAI	2007	DBLP BibTeX RDF
29	Ian P. Gent, Peter Nightingale, Kostas Stergiou 0001	QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems.	IJCAI	2005	DBLP BibTeX RDF
19	Florent R. Madelaine, Barnaby Martin	The Complexity of Positive First-order Logic without Equality.	LICS	2009	DBLP DOI BibTeX RDF
19	Alexandre Goldsztejn, Claude Michel, Michel Rueher	An efficient algorithm for a sharp approximation of universally quantified inequalities.	SAC	2008	DBLP DOI BibTeX RDF	continuous domains, quantified constraints, interval arithmetic
19	Marco Benedetti, Arnaud Lallouet, Jérémie Vautard	Quantified Constraint Optimization.	CP	2008	DBLP DOI BibTeX RDF
19	Martin Sachenbacher, Paul Maier	Test Strategy Generation Using Quantified CSPs.	CP	2008	DBLP DOI BibTeX RDF	adversarial planning, quantified CSPs, Test generation
19	Peter Nightingale	Consistency for Quantified Constraint Satisfaction Problems.	CP	2005	DBLP DOI BibTeX RDF