default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth McAloon
Person information
- affiliation: Brooklyn College, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[c18]Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tretkoff:
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. AIPS 1998: 208-213- [c17]Ken McAloon:
Disjunctive Linear Programming: At the Intersection of Operations Research and Logic Programming. IJCSLP 1998: 5-6 - 1997
- [j13]Ken McAloon, Carol Tretkoff:
Logic, modeling, and programming. Ann. Oper. Res. 71: 335-372 (1997) - 1996
- [b1]Kenneth McAloon, Carol Tretkoff:
Optimization and computational logic. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1996, ISBN 978-0-471-11533-5, pp. I-XI, 1-536 - [j12]Ken McAloon:
Constraint-Based Programming. ACM Comput. Surv. 28(4es): 69 (1996) - [j11]Geun Sik Jo, Ken McAloon:
Anticipatory pruning networks and forward checking in CLP over continuous domains. Decis. Support Syst. 18(3-4): 327-340 (1996) - 1995
- [c16]David M. Arnow, Ken McAloon, Carol Tretkoff:
Parallel Integer Goal Programming. ACM Conference on Computer Science 1995: 42-47 - 1994
- [c15]David M. Arnow, Ken McAloon, Carol Tretkoff:
Distributed Programming and Disjunctive Programming. Workshop on Design and Impl. of Parallel Logic Programming Systems 1994: 120-129 - 1993
- [c14]Ken McAloon, Carol Tretkoff:
2lp: Linear Programming and Logic Programming. PPCP 1993: 178-189 - [c13]C. Atay, Ken McAloon, Carol Tretkoff:
2lp: A Highly Parallel Constraint Logic Programming Language. PPSC 1993: 822-828 - 1992
- [j10]Jim Cox, Ken McAloon, Carol Tretkoff:
Computational Complexity and Constraint Logic Programming Languages. Ann. Math. Artif. Intell. 5(2-4): 163-189 (1992) - [j9]Gabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry:
A Note on the Parallel Complexity of Anti-Unification. J. Autom. Reason. 9(3): 381-389 (1992) - [j8]Jean-Louis Lassez, Ken McAloon:
A Canonical Form for Generalized Linear Constraints. J. Symb. Comput. 13(1): 1-24 (1992) - 1991
- [c12]Jim Cox, Ken McAloon:
Decision Procedures for Constraint Based Extensions of Datalog. WCLP 1991: 17-32 - [c11]Jean-Louis Lassez, Ken McAloon:
A Constraint Sequent Calculus. WCLP 1991: 33-43 - [c10]Jean-Louis Lassez, Tien Huynh, Ken McAloon:
Simplification and Elimination of Redundant Linear Arithmetic Constraints. WCLP 1991: 73-87 - 1990
- [c9]Jean-Louis Lassez, Ken McAloon:
A Constraint Sequent Calculus. LICS 1990: 52-61 - [c8]Jim Cox, Ken McAloon, Carol Tretkoff:
Computational Complexity and Constraint Logic Programming Languages. NACLP 1990: 401-415
1980 – 1989
- 1989
- [j7]Catherine Lassez, Ken McAloon, Graeme S. Port:
Stratification and Knowledge Base Management. J. Symb. Comput. 7(5): 509-522 (1989) - [c7]Jean-Louis Lassez, Tien Huynh, Ken McAloon:
Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP 1989: 37-51 - [c6]Jean-Louis Lassez, Ken McAloon:
Independence of Negative Constraints. TAPSOFT, Vol.1 1989: 19-27 - 1988
- [j6]Nicolas D. Goodman, Harold T. Hodes, Carl G. Jockusch Jr., Kenneth McAloon:
Annual Meeting of the Association for Symbolic Logic, New York City, December 1987. J. Symb. Log. 53(4): 1287-1299 (1988) - [c5]Jean-Louis Lassez, Ken McAloon:
Applications of a Canonical Form of Gerneralized Linear Constraints. FGCS 1988: 703-710 - [c4]Gabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry:
Efficient Parallel Algorithms for Anti-Unification and Relative Complement. LICS 1988: 112-120 - 1987
- [j5]Akihiro Kanamori, Kenneth McAloon:
On Gödel incompleteness and finite combinatorics. Ann. Pure Appl. Log. 33: 23-41 (1987) - [j4]Catherine Lassez, Ken McAloon, Roland H. C. Yap:
Constraint Logic Programming and Option Trading. IEEE Expert 2(3): 42-50 (1987) - [c3]Catherine Lassez, Ken McAloon, Graeme S. Port:
Stratification and Knowledge Based Management. ICLP 1987: 136-151 - [c2]Catherine Lassez, Ken McAloon:
Stratified Interactive Knowledge Bases. ISMIS 1987: 408-415 - 1986
- [c1]Ken McAloon:
Separation Results for Bounded Alternation. SCT 1986: 265-271 - 1984
- [j3]Ken McAloon:
Petri Nets and Large Finite Sets. Theor. Comput. Sci. 32: 173-183 (1984) - 1983
- [j2]Peter Clote, Kenneth McAloon:
Two Further Combinatorial Theorems Equivalent to the 1-Consistency of Peano Arithmetic. J. Symb. Log. 48(4): 1090-1104 (1983) - 1982
- [j1]Kenneth McAloon:
On the Complexity of Models of Arithmetic. J. Symb. Log. 47(2): 403-415 (1982)
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-07-04 22:20 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:
