default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan M. Frisch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c40]Özgür Akgün
, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Conjure: Automatic Generation of Constraint Models from Problem Specifications (Extended Abstract). IJCAI 2023: 6833-6838- 2022
- [j17]Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale:
Conjure: Automatic Generation of Constraint Models from Problem Specifications. Artif. Intell. 310: 103751 (2022) - 2021
- [i7]Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon:
Towards Reformulating Essence Specifications for Robustness. CoRR abs/2111.00821 (2021)
2010 – 2019
- 2019
- [i6]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
A Commentary on "Breaking Row and Column Symmetries in Matrix Models". CoRR abs/1910.01423 (2019) - 2013
- [c39]Ozgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale:
Automated Symmetry Breaking and Model Selection in Conjure. CP 2013: 107-116 - [e3]Alan M. Frisch, Peter Gregory:
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013, 11-12 July 2013, Leavenworth, Washington, USA. AAAI 2013, ISBN 978-1-57735-630-1 [contents] - [i5]Alan M. Frisch, Peter Haddawy:
Probability as a Modal Operator. CoRR abs/1304.2352 (2013) - [i4]Peter Haddawy, Alan M. Frisch:
Convergent Deduction for Probabilistic Logic. CoRR abs/1304.2742 (2013) - 2011
- [c38]Ozgur Akgun, Ian Miguel, Christopher Jefferson, Alan M. Frisch, Brahim Hnich:
Extensible Automated Constraint Modelling. AAAI 2011: 4-11 - [i3]Ozgur Akgun, Alan M. Frisch, Brahim Hnich, Christopher Jefferson, Ian Miguel:
Conjure Revisited: Towards Automated Constraint Modelling. CoRR abs/1109.1774 (2011)
2000 – 2009
- 2009
- [j16]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
Filtering algorithms for the multiset ordering constraint. Artif. Intell. 173(2): 299-328 (2009) - [c37]Alan M. Frisch, Peter J. Stuckey:
The Proper Treatment of Undefinedness in Constraint Languages. CP 2009: 367-382 - [i2]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
Filtering Algorithms for the Multiset Ordering Constraint. CoRR abs/0903.0460 (2009) - [i1]Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh:
Multiset Ordering Constraints. CoRR abs/0905.3769 (2009) - 2008
- [j15]Alan M. Frisch, Ian Miguel:
Introduction to the Special Issue on Abstraction and Automation in Constraint Modelling. Constraints An Int. J. 13(3): 227-228 (2008) - [j14]Alan M. Frisch, Warwick Harvey, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
Essence : A constraint language for specifying combinatorial problems. Constraints An Int. J. 13(3): 268-306 (2008) - 2007
- [c36]Alan M. Frisch, Matthew Grum, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems. IJCAI 2007: 80-87 - [c35]Alan M. Frisch:
Abstraction and Reformulation in the Generation of Constraint Models. SARA 2007: 2-3 - 2006
- [j13]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
Propagation algorithms for lexicographic ordering constraints. Artif. Intell. 170(10): 803-834 (2006) - 2005
- [j12]Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter Nightingale:
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings. J. Autom. Reason. 35(1-3): 143-179 (2005) - [c34]Bernadette Martínez Hernández, Alan M. Frisch:
Towards the Systematic Generation of Channelling Constraints. CP 2005: 859 - [c33]Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth:
The Temporal Knapsack Problem and Its Solution. CPAIOR 2005: 34-48 - [c32]Alan M. Frisch, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
The Rules of Constraint Modelling. IJCAI 2005: 109-116 - [c31]Alan M. Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith, Toby Walsh:
Transforming and Refining Abstract Constraint Specifications. SARA 2005: 76-91 - 2004
- [c30]Alan M. Frisch, Christopher Jefferson, Ian Miguel:
Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern. ECAI 2004: 171-175 - 2003
- [c29]Alan M. Frisch, Christopher Jefferson, Ian Miguel:
Constraints for Breaking More Row and Column Symmetries. CP 2003: 318-332 - [c28]Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh:
Multiset Ordering Constraints. IJCAI 2003: 221-226 - [c27]Lyndon Drake, Alan M. Frisch:
The Interaction Between Inference and Branching Heuristics. SAT 2003: 370-382 - 2002
- [c26]Lyndon Drake, Alan M. Frisch:
Combining Inference and Search for the Propositional Satisfiability Problem. AAAI/IAAI 2002: 982 - [c25]Alan M. Frisch, Ian Miguel, Toby Walsh:
CGRASS: A System for Transforming Constraint Satisfaction Problems. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 15-30 - [c24]Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
Global Constraints for Lexicographic Orderings. CP 2002: 93-108 - [c23]Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson, Toby Walsh:
Breaking Row and Column Symmetries in Matrix Models. CP 2002: 462-476 - [c22]Lyndon Drake, Alan M. Frisch, Toby Walsh:
Automatic Generation of Implied Clauses for SAT. CP 2002: 783 - [c21]Alan M. Frisch, Daniel Sheridan, Toby Walsh:
A Fixpoint Based Encoding for Bounded Model Checking. FMCAD 2002: 238-255 - 2001
- [c20]Alan M. Frisch, Timothy J. Peugniez:
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search. IJCAI 2001: 282-290 - 2000
- [c19]Alan M. Frisch, Toby Walsh:
Automatic Generation of Implied Constraints: Project Description. ARW 2000 - [e2]James Cussens, Alan M. Frisch:
Inductive Logic Programming, 10th International Conference, ILP 2000, Work-in-progress reports, London, UK, July 2000, Proceedings. CEUR Workshop Proceedings 35, CEUR-WS.org 2000 [contents] - [e1]James Cussens, Alan M. Frisch:
Inductive Logic Programming, 10th International Conference, ILP 2000, London, UK, July 24-27, 2000, Proceedings. Lecture Notes in Computer Science 1866, Springer 2000, ISBN 3-540-67795-X [contents]
1990 – 1999
- 1999
- [j11]Alan M. Frisch:
Solving Constraint Satisfaction Problems with NB-Resolution. Electron. Trans. Artif. Intell. 3(B): 105-120 (1999) - [j10]Simon Anthony, Alan M. Frisch:
Cautious Induction: An Alternative to Clause-at-a Time Hypothesis Construction in Inductive Logic Programming. New Gener. Comput. 17(1): 25-52 (1999) - [c18]Alan M. Frisch:
Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive Programming. ILP 1999: 104-115 - 1997
- [c17]Simon Anthony, Alan M. Frisch:
Cautious Induction in Inductive Logic Programming. ILP 1997: 45-60 - [c16]Simon Anthony, Alan M. Frisch:
Generating Numerical Literals During Refinement. ILP 1997: 61-76 - 1995
- [c15]Alan M. Frisch, C. David Page Jr.:
Building Theories into Instantiation. IJCAI 1995: 1210-1216 - 1994
- [j9]Alan M. Frisch, Peter Haddawy:
Anytime Deduction for Probabilistic Logic. Artif. Intell. 69(1-2): 93-122 (1994) - 1992
- [c14]Alan M. Frisch, Anthony G. Cohn:
An Abstract View of Sorted Unification. CADE 1992: 178-192 - [c13]Tomás E. Uribe, Alan M. Frisch, Michael K. Mitchell:
An Overview of FRAPPS 2.0: A Framework for Resolution-based Automated Proof Procedure Systems. CADE 1992: 721-725 - 1991
- [j8]Alan M. Frisch:
The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning. Artif. Intell. 49(1-3): 161-198 (1991) - [j7]Alan M. Frisch, Anthony G. Cohn:
Thoughts and Afterthoughts on the 1988 Workshop on Principles of Hybrid Reasoning. AI Mag. 11(5): 77-83 (1991) - [j6]Alan M. Frisch, Richard B. Scherl:
A Bibliography on Hybrid Reasoning. AI Mag. 11(5): 84-87 (1991) - [c12]C. David Page Jr., Alan M. Frisch:
Learning Constrained Atoms. ML 1991: 427-431 - [c11]Alan M. Frisch, Richard B. Scherl:
A General Framework for Modal Deduction. KR 1991: 196-207 - [c10]C. David Page Jr., Alan M. Frisch:
Generalizing Atoms in Constraint Logic. KR 1991: 429-440 - 1990
- [c9]Alan M. Frisch, C. David Page Jr.:
Generalization with Taxonomic Information. AAAI 1990: 755-761 - [c8]Alan M. Frisch, Richard B. Scherl:
A Constraint Logic Approach to Modal Deduction. JELIA 1990: 234-250
1980 – 1989
- 1989
- [c7]Alan M. Frisch:
A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning. KR 1989: 126-136 - 1988
- [j5]Peter Haddawy, Alan M. Frisch:
Convergent deduction for probabilistic logic. Int. J. Approx. Reason. 2(3): 335 (1988) - [c6]Peter Haddawy, Alan M. Frisch:
Modal logics of higher-order probability. UAI 1988: 133-148 - 1987
- [c5]Alan M. Frisch:
Inference without Chaining. IJCAI 1987: 515-519 - 1986
- [j4]Alan M. Frisch:
Parsing with restricted quantification: an initial demonstration. Comput. Intell. 2: 142-150 (1986) - 1985
- [j3]Alan M. Frisch:
An investigation into inference with restricted quantification and a taxonomic representation. SIGART Newsl. 91: 28-31 (1985) - [c4]Alan M. Frisch:
Using Model Theory to Specify AI Programs. IJCAI 1985: 148-154 - 1983
- [j2]Alan M. Frisch, James F. Allen, Mark Giuliano:
An overview of the HORNE logic programming system. SIGART Newsl. 84: 27-29 (1983) - 1982
- [c3]James F. Allen, Alan M. Frisch, Diane J. Litman:
ARGOT: The Rochester Dialogue System. AAAI 1982: 66-70 - [c2]James F. Allen, Alan M. Frisch:
What's in a Semantic Network? ACL 1982: 19-27 - [c1]Alan M. Frisch, James F. Allen:
Knowledge Retrieval as Limited Inference. CADE 1982: 274-291 - 1981
- [j1]Alan M. Frisch, Donald Perlis:
A Re-Evaluation of Story Grammars. Cogn. Sci. 5(1): 79-86 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
