Phase transitions in artificial intelligence systems
Artificial Intelligence
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Clustering at the phase transition
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
DISTANCE-SAT: complexity and algorithms
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Towards a definition of robustness for market-style open multi-agent systems
Proceedings of the fifth international conference on Autonomous agents
Dynamic Bundling: Less Effort for More Solutions
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
An Empirical Evaluation of the Effectiveness of Local Search for Replanning
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Towards mathematical morpho-logics
Technologies for constructing intelligent systems
Robust solutions for combinatorial auctions
Proceedings of the 6th ACM conference on Electronic commerce
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Discrete Applied Mathematics
Directional Interchangeability for Enhancing CSP Solving
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Domain transmutation in constraint satisfaction problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Robust solutions for constraint satisfaction and optimization
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Exploration of the robustness of plans
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Finding diverse and similar solutions in constraint programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Weighted super solutions for constraint programs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Fault tolerant Boolean satisfiability
Journal of Artificial Intelligence Research
A declarative approach to robust weighted Max-SAT
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Balancing Optimality and Robustness in Resource Allocation Problems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Super solutions for combinatorial auctions
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Logics for approximate and strong entailments
Fuzzy Sets and Systems
Dynamic SAT with decision change costs: formalization and solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Robustness for a single railway line: Analytical and simulation methods
Expert Systems with Applications: An International Journal
Reformulation based MaxSAT robustness
Constraints
Hi-index | 0.00 |
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large effect on the viability of the solution. The AI community has responded to this difficulty by investigating the development of "robust problem solvers" that are intended to be proof against this difficulty.We argue that robustness is best cast not as a property of the problem solver, but as a property of the solution. We introduce a new class of models for a logical theory, called supermodels, that captures this idea. Supermodels guarantee that the model in question is robust, and allow us to quantify the degree to which it is so.We investigate the theoretical properties of supermodels, showing that finding supermodels is typically of the same theoretical complexity as finding models. We provide a general way to modify a logical theory so that a model of the modified theory is a supermodel of the original. Experimentally, we show that the supermodel problem exhibits phase transition behavior similar to that found in other satisfiability work.