Alan M. Frisch

Orcid: 0000-0001-5015-2676

According to our database1, Alan M. Frisch authored at least 61 papers between 1981 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Conjure: Automatic Generation of Constraint Models from Problem Specifications (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Conjure: Automatic Generation of Constraint Models from Problem Specifications.
Artif. Intell., 2022

2021
Towards Reformulating Essence Specifications for Robustness.
CoRR, 2021

2019
A Commentary on "Breaking Row and Column Symmetries in Matrix Models".
CoRR, 2019

2013
Probability as a Modal Operator
CoRR, 2013

Automated Symmetry Breaking and Model Selection in Conjure.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2011
Conjure Revisited: Towards Automated Constraint Modelling
CoRR, 2011

Extensible Automated Constraint Modelling.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2009
Filtering algorithms for the multiset ordering constraint.
Artif. Intell., 2009

The Proper Treatment of Undefinedness in Constraint Languages.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
Introduction to the Special Issue on Abstraction and Automation in Constraint Modelling.
Constraints An Int. J., 2008

Essence : A constraint language for specifying combinatorial problems.
Constraints An Int. J., 2008

2007
Abstraction and Reformulation in the Generation of Constraint Models.
Proceedings of the Abstraction, 2007

The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems.
Proceedings of the IJCAI 2007, 2007

2006
Propagation algorithms for lexicographic ordering constraints.
Artif. Intell., 2006

2005
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings.
J. Autom. Reason., 2005

Transforming and Refining Abstract Constraint Specifications.
Proceedings of the Abstraction, 2005

The Rules of Constraint Modelling.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

The Temporal Knapsack Problem and Its Solution.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

Towards the Systematic Generation of Channelling Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003
The Interaction Between Inference and Branching Heuristics.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Multiset Ordering Constraints.
Proceedings of the IJCAI-03, 2003

Constraints for Breaking More Row and Column Symmetries.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
A Fixpoint Based Encoding for Bounded Model Checking.
Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

Global Constraints for Lexicographic Orderings.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Breaking Row and Column Symmetries in Matrix Models.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Automatic Generation of Implied Clauses for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2002

CGRASS: A System for Transforming Constraint Satisfaction Problems.
Proceedings of the Recent Advances in Constraints, 2002

Combining Inference and Search for the Propositional Satisfiability Problem.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Automatic Generation of Implied Constraints: Project Description.
Proceedings of the Seventh Workshop on Automated Reasoning, 2000

1999
Cautious Induction: An Alternative to Clause-at-a Time Hypothesis Construction in Inductive Logic Programming.
New Gener. Comput., 1999

Solving Constraint Satisfaction Problems with NB-Resolution.
Electron. Trans. Artif. Intell., 1999

Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive Programming.
Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

1997
Generating Numerical Literals During Refinement.
Proceedings of the Inductive Logic Programming, 7th International Workshop, 1997

Cautious Induction in Inductive Logic Programming.
Proceedings of the Inductive Logic Programming, 7th International Workshop, 1997

1995
Building Theories into Instantiation.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Anytime Deduction for Probabilistic Logic.
Artif. Intell., 1994

1992
An Overview of FRAPPS 2.0: A Framework for Resolution-based Automated Proof Procedure Systems.
Proceedings of the Automated Deduction, 1992

An Abstract View of Sorted Unification.
Proceedings of the Automated Deduction, 1992

1991
A Bibliography on Hybrid Reasoning.
AI Mag., 1991

Thoughts and Afterthoughts on the 1988 Workshop on Principles of Hybrid Reasoning.
AI Mag., 1991

The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning.
Artif. Intell., 1991

Generalizing Atoms in Constraint Logic.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

A General Framework for Modal Deduction.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Learning Constrained Atoms.
Proceedings of the Eighth International Workshop (ML91), 1991

1990
A Constraint Logic Approach to Modal Deduction.
Proceedings of the Logics in AI, European Workshop, 1990

Generalization with Taxonomic Information.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989
A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

1988
Convergent deduction for probabilistic logic.
Int. J. Approx. Reason., 1988

Modal logics of higher-order probability.
Proceedings of the UAI '88: Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence, 1988

1987
Inference without Chaining.
Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

1986
Parsing with restricted quantification: an initial demonstration.
Comput. Intell., 1986

1985
An investigation into inference with restricted quantification and a taxonomic representation.
SIGART Newsl., 1985

Using Model Theory to Specify AI Programs.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1983
An overview of the HORNE logic programming system.
SIGART Newsl., 1983

1982
Knowledge Retrieval as Limited Inference.
Proceedings of the 6th Conference on Automated Deduction, 1982

What's in a Semantic Network?
Proceedings of the 20th Annual Meeting of the Association for Computational Linguistics, 1982

ARGOT: The Rochester Dialogue System.
Proceedings of the National Conference on Artificial Intelligence, 1982

1981
A Re-Evaluation of Story Grammars.
Cogn. Sci., 1981


  Loading...