| Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values | 0 | 0.34 | 2022 |
| Knowledge Compilation for Nondeterministic Action Languages. | 0 | 0.34 | 2021 |
| Knowledge-based programs as succinct policies for partially observable domains | 0 | 0.34 | 2020 |
| An Experimental Study of Advice in Sequential Decision-Making Under Uncertainty. | 0 | 0.34 | 2018 |
| Knowledge-Based Policies for Qualitative Decentralized POMDPs. | 0 | 0.34 | 2018 |
| Amélioration continue d'une chaîne de traitement de documents avec l'apprentissage par renforcement. | 0 | 0.34 | 2017 |
| Online Learning of Acyclic Conditional Preference Networks from Noisy Data | 0 | 0.34 | 2017 |
| Strong partial clones and the time complexity of SAT problems. | 6 | 0.54 | 2017 |
| Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. | 0 | 0.34 | 2016 |
| Efficient Representations for the Modal Logic S5. | 1 | 0.35 | 2016 |
| Model-Free Reinforcement Learning with Skew-Symmetric Bilinear Utilities. | 2 | 0.44 | 2016 |
| Building Document Treatment Chains Using Reinforcement Learning and Intuitive Feedback | 0 | 0.34 | 2016 |
| Bounded Bases of Strong Partial Clones | 3 | 0.42 | 2015 |
| Probabilistic Knowledge-Based Programs. | 0 | 0.34 | 2015 |
| Continuous improvement of a document treatment chain using reinforcement learning | 0 | 0.34 | 2015 |
| A study of sybil manipulations in hedonic games | 0 | 0.34 | 2014 |
| Learning Probabilistic CP-nets from Observations of Optimal Items. | 1 | 0.35 | 2014 |
| On Broken Triangles. | 8 | 0.53 | 2014 |
| Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. | 3 | 0.41 | 2013 |
| Complexity of SAT problems, clone theory and the exponential time hypothesis | 14 | 0.81 | 2013 |
| Probabilistic Conditional Preference Networks. | 15 | 0.73 | 2013 |
| Interactive value iteration for Markov decision processes with unknown rewards | 9 | 0.54 | 2013 |
| Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. | 5 | 0.45 | 2013 |
| Application du problème de caractérisation multiple à la conception de tests de diagnostic pour la biologie végétale. | 2 | 0.41 | 2013 |
| Knowledge-Based Programs as Plans - The Complexity of Plan Verification. | 8 | 0.51 | 2012 |
| On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. | 1 | 0.35 | 2012 |
| New polynomial classes for logic-based abduction | 11 | 0.74 | 2011 |
| Handling ambiguous effects in action learning | 0 | 0.34 | 2011 |
| Efficient Policy Construction for MDPs Represented in Probabilistic PDDL. | 1 | 0.35 | 2011 |
| Résolution exacte et approchée de problèmes de décision markoviens formulés en logique propositionnelle | 0 | 0.34 | 2010 |
| Learning conditional preference networks | 15 | 0.67 | 2010 |
| Compact preference representation and Boolean games | 25 | 1.19 | 2009 |
| Frozen Boolean Partial Co-clones | 7 | 0.50 | 2009 |
| Learning conditional preference networks with queries | 10 | 0.68 | 2009 |
| Making bound consistency as effective as arc consistency | 0 | 0.34 | 2009 |
| A note on some collapse results of valued constraints | 0 | 0.34 | 2009 |
| What makes propositional abduction tractable | 12 | 0.55 | 2008 |
| Structure identification of Boolean relations and plain bases for co-clones | 23 | 1.05 | 2008 |
| Efficient Algorithms for Description Problems over Finite Totally Ordered Domains | 2 | 0.38 | 2008 |
| Specifying and Verifying a MAS: The Robots on MarsCase Study | 0 | 0.34 | 2007 |
| A Complete Classification of the Complexity of Propositional Abduction | 27 | 1.11 | 2006 |
| Boolean Games Revisited | 30 | 1.73 | 2006 |
| Preferred representations of Boolean relations | 10 | 0.77 | 2005 |
| Propositional abduction is almost always hard | 10 | 0.56 | 2005 |
| Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract | 0 | 0.34 | 2004 |
| An efficient algorithm for Horn description | 5 | 0.48 | 2003 |
| Approximation of Relations by Propositional Formulas: Complexity and Semantics | 6 | 0.51 | 2002 |
| A unified framework for structure identification | 12 | 0.79 | 2002 |
| Approximating Propositional Knowledge with Affine Formulas | 5 | 0.46 | 2002 |
