Automatic Generation of Implied Constraints

No abstract is available for this paper.

• Publication year

  2006

• Venue

  European Conference on Artificial Intelligence

• Publication date

  2006-05-22

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Expressing General Problems as CSPs

  2006cited by this paper
• Machine Learning Case Splits for Theorem Proving

  2005cited by this paper
• Acquiring Parameters of Implied Global Constraints

  2005cited by this paper
• A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems

  2005cited by this paper
• Leveraging the Learning Power of Examples in Automated Constraint Acquisition

  2004cited by this paper
• Streamlined Constraint Reasoning

  2004cited by this paper
• Using Case-Based Reasoning to Write Constraint Programs

  2003cited by this paper
• CGRASS: A System for Transforming Constraint Satisfaction Problems

  2002cited by this paper
• Automated Theory Formation in Pure Mathematics

  2002cited by this paper
• Capturing Constraint Programming Experience: A Case-Based Approach

  2002cited by this paper
• Constraint Generation via Automated Theory Formation

  2001influential reference
• Resolution versus Search: Two Strategies for SAT

  2000cited by this paper
• Modelling the Golomb Ruler Problem

  1999cited by this paper
• Automatic Concept Formation in Pure Mathematics

  1999cited by this paper
• Programming with Constraints: An Introduction

  1998cited by this paper
• An Open-Ended Finite Domain Constraint Solver

  1997cited by this paper
• Adding New Clauses for Faster Local Search

  1996cited by this paper
• Conflict analysis in search algorithms for satisfiability

  1996cited by this paper
• Stochastic Programming

  1995cited by this paper
• Rippling: A Heuristic for Guiding Inductive Proofs

  1993cited by this paper
• The Use of Proof Plans to Sum Series

  1992cited by this paper
• A Science of Reasoning

  1991cited by this paper
• Principles of automated theorem proving

  1991cited by this paper
• Generalized first-order spectra, and polynomial. time recognizable sets

  1974cited by this paper

• StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners

  2025cites this paper
• Search‐Based MC/DC Test Data Generation With OCL Constraints

  2024cites this paper
• Automating Reformulation of Essence Specifications via Graph Rewriting

  2024cites this paper
• Scalable Knowledge Refactoring using Constrained Optimisation

  2024cites this paper
• Efficient Test Data Generation for MC/DC with OCL and Search

  2024cites this paper
• Generating Streamlining Constraints with Large Language Models

  2024cites this paper
• Automatic Core-Guided Reformulation via Constraint Explanation and Condition Learning

  2024cites this paper
• Towards Exploratory Reformulation of Constraint Models

  2023cites this paper
• Automated streamliner portfolios for constraint satisfaction problems

  2023cites this paper
• Acquiring Maps of Interrelated Conjectures on Sharp Bounds

  2022cites this paper
• Conjure: Automatic Generation of Constraint Models from Problem Specifications

  2022cites this paper
• Learning logic programs by discovering where not to search

  2022cites this paper
• Towards Reformulating Essence Specifications for Robustness

  2021cites this paper
• Invariants for time-series constraints

  2020cites this paper
• Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem

  2020cites this paper
• Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints

  2019cites this paper
• Learning Human Intention for Taskable Agents

  2019cites this paper
• Machine-Assisted Reformulation for MiniZinc

  2019cites this paper
• Automatic Streamlining for Constrained Optimisation

  2019cites this paper
• Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice

  2018cites this paper
• A review of literature on parallel constraint solving

  2018cites this paper
• Functional description of sequence constraints and synthesis of combinatorial objects. (Description fonctionnelle de contraintes sur des séquences et synthèse d'objets combinatoires)

  2018cites this paper
• Progress towards the Holy Grail

  2017cites this paper
• Generating Linear Invariants for a Conjunction of Automata Constraints

  2017cites this paper
• Automatically improving constraint models in Savile Row

  2017influential citation
• Learning the Parameters of Global Constraints Using Branch-and-Bound

  2017cites this paper
• Beyond the Holy Grail - Automatically Generating Constraint Propagators for Conjunctions of Time-Series Constraints

  2017cites this paper
• Answer Set Solving with Generalized Learned Constraints

  2016cites this paper
• Extensible automated constraint modelling via refinement of abstract problem specifications

  2016cites this paper
• Automatically Generating Streamlined Constraint Models with Essence and Conjure

  2015cites this paper
• Reasoning about Constraint Models

  2014cites this paper
• An artificial intelligence framework for investigative reasoning

  2014influential citation
• Computing relatively large algebraic structures by automated theory exploration

  2014cites this paper
• Discriminating Instance Generation for Automated Constraint Model Selection

  2014cites this paper
• Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE

  2014cites this paper
• A method for detecting symmetries in constraint models and its generalisation

  2014influential citation
• The HR3 discovery system: design decisions and implementation details

  2014cites this paper
• A Review of Constraint Programming

  2014cites this paper
• Globalizing Constraint Models

  2013cites this paper
• Automated Symmetry Breaking and Model Selection in Conjure

  2013cites this paper
• Automated Theory Formation: The Next Generation

  2013cites this paper
• Opportunities and Challenges for Constraint Programming

  2012cites this paper
• Algebraic Theory Exploration: A Comparison of Technologies

  2012cites this paper
• Discovering Constraints for Inductive Process Modeling

  2012cites this paper
• From Streamlined Combinatorial Search to Efficient Constructive Procedures

  2012cites this paper
• A Model Seeker: Extracting Global Constraint Models from Positive Examples

  2012influential citation
• Apprentissage de probl emes de contraintes

  2012cites this paper
• Computational Creativity: The Final Frontier?

  2012cites this paper
• Formal Aspects of Computing Formal Aspects of Computing Discovery of invariants through automated theory formation

  2012cites this paper
• A Constraint Seeker: Finding and Ranking Global Constraints from Examples

  2011cites this paper
• Learning Structured Constraint Models: a First Attempt

  2011cites this paper
• ERCIM Workshop on Constraint Solving and Constraint Logic Programming, 2011

  2011cites this paper
• Conjure Revisited: Towards Automated Constraint Modelling

  2011cites this paper
• Extensible Automated Constraint Modelling

  2011cites this paper
• Using the Global Constraint Seeker for Learning Structured Constraint Models: A First Attempt

  2011cites this paper
• Effective compilation of constraint models

  2010cites this paper
• Problèmes d'apprentissage de contraintes

  2010cites this paper
• Automated Modelling and Solving in Constraint Programming

  2010cites this paper
• Discovering implied constraints in precedence graphs with alternatives

  2010cites this paper
• Proceedings of the automated reasoning workshop 2010: bridging the gap between theory and practice. ARW 2010

  2010cites this paper
• On Learning Constraint Problems

  2010cites this paper
• Applying Lakatos-style reasoning to AI domains

  2010cites this paper
• Automatic symmetry detection and dynamic symmetry breaking for constraint programming

  2009cites this paper
• Towards the automatic invention of simple mixed reality games

  2009cites this paper
• Applying Lakatos-style reasoning to AI problems

  2009cites this paper
• A global workspace framework for combined reasoning

  2009cites this paper
• Applications of a Global Workspace Framework to Mathematical Discovery

  2008cites this paper
• A Global Workspace Framework for Combining Reasoning Systems

  2008cites this paper
• Joined-Up Reasoning for Automated Scientific Discovery: A Position Statement and Research Agenda

  2008cites this paper
• A cognitive model of axiom formulation and reformulation with application to AI and software engineering

  2007cites this paper
• Reformulation during Automated Constraint Modelling student : Andrea Rendl supervisors

  2007cites this paper
• Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion

  2007influential citation
• Experimental Results on the Satisfiable Core in Random 3SAT

  2006cites this paper
• Combining Automated Reasoning Systems using Global Workspace Architectures

  2006influential citation
• Expressing General Problems as CSPs

  2006cites this paper
• Computational Creativity

  2006cites this paper
• Automated Nogood-Filtered Fine-Grained Streamlining: A Case Study on Covering Arrays

  year unknowncites this paper