{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T20:16:27Z","timestamp":1672431387826},"reference-count":59,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0304-3975(92)90389-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"105-130","source":"Crossref","is-referenced-by-count":9,"title":["Integer programs for logic constraint satisfaction"],"prefix":"10.1016","volume":"97","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90389-W_BIB1","series-title":"Pandora: Non-deterministic parallel logic programming","author":"Bahgat","year":"1988"},{"key":"10.1016\/0304-3975(92)90389-W_BIB2","article-title":"Disjunctive programming: Cutting planes from logical conditions","volume":"2","author":"Balas","year":"1975"},{"key":"10.1016\/0304-3975(92)90389-W_BIB3","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/0304-3975(92)90389-W_BIB4","series-title":"Hypergraphs","author":"Berge","year":"1989"},{"key":"10.1016\/0304-3975(92)90389-W_BIB5","series-title":"Advanced Techniques in O.R.","article-title":"Matroids and operations research","author":"Bixby","year":"1982"},{"key":"10.1016\/0304-3975(92)90389-W_BIB6","doi-asserted-by":"crossref","DOI":"10.1137\/0210043","article-title":"An average time analysis of backtracking","volume":"10","author":"Brown","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90389-W_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/S0195-6698(85)80031-7","article-title":"Cutting planes in combinatorics","volume":"6","author":"Chvatal","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/0304-3975(92)90389-W_BIB8","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Ann. ACM Symp. Theory Comput."},{"key":"10.1016\/0304-3975(92)90389-W_BIB9","series-title":"Planning and Operation Research in Artificial Intelligence","author":"Daniel","year":"1983"},{"key":"10.1016\/0304-3975(92)90389-W_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90389-W_BIB11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90389-W_BIB12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: Backjumping, learning, and cutset deomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90389-W_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/77481.77485","article-title":"Integer programming vs. expert systems: An experimental comparison","author":"Dhar","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90389-W_BIB14","series-title":"Proc. 5th Internat. Conf. and Symp. on Logic Programming","article-title":"Solving a cutting-stock problem in constraint logic programming","author":"Dincbas","year":"1988"},{"key":"10.1016\/0304-3975(92)90389-W_BIB15","article-title":"Maximum matching and polyhedron with 0, 1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0304-3975(92)90389-W_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition of backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90389-W_BIB17","series-title":"Computer and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(92)90389-W_BIB18","series-title":"Recent Advances in Mathematical Programming","article-title":"An algorithm for integer solutions to linear programs","author":"Gomory","year":"1963"},{"issue":"1","key":"10.1016\/0304-3975(92)90389-W_BIB19","doi-asserted-by":"crossref","DOI":"10.1057\/jors.1986.7","article-title":"Lessons for O.R. from A.I.: A scheduling case study","volume":"37","author":"Grant","year":"1986","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0304-3975(92)90389-W_BIB20","series-title":"Linear Inequalities and Related Systems","article-title":"Integral boundary points of convex polyhedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/0304-3975(92)90389-W_BIB21","article-title":"The matching problem for bipartite graphs","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90389-W_BIB22","series-title":"Algorithms and Complexity","article-title":"Complementary approaches to CNF boolean equations","author":"Iwama","year":"1987"},{"key":"10.1016\/0304-3975(92)90389-W_BIB23","article-title":"Constraint logic programming","author":"Jaffar","year":"1987","journal-title":"Proc. Conf. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(92)90389-W_BIB24","article-title":"A new polynomial time algorithm for linear programming","author":"Karmarkar","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90389-W_BIB25","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(92)90389-W_BIB26","series-title":"Soviet Math. Dok.","article-title":"A polynomial algorithm for linear programming","author":"Khachian","year":"1979"},{"key":"10.1016\/0304-3975(92)90389-W_BIB27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problem","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90389-W_BIB28","doi-asserted-by":"crossref","DOI":"10.1145\/359657.359664","article-title":"Optimization decision trees through heuristically guided search","volume":"21","author":"Martelli","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90389-W_BIB29","doi-asserted-by":"crossref","DOI":"10.1137\/0212022","article-title":"Towards a genuinely polynomial algorithm for linear programming","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90389-W_BIB30","series-title":"Proc. 21st Ann. Symp. on the Foundation of Computer Science","article-title":"An algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0304-3975(92)90389-W_BIB31","article-title":"School time table scheduling in Prolog","volume":"96","author":"Monfroglio","year":"1986","journal-title":"SIGART Newsletter"},{"issue":"4","key":"10.1016\/0304-3975(92)90389-W_BIB32","article-title":"Soddisfacimento di vincoli e programmazione logica parallela","volume":"XVI","author":"Monfroglio","year":"1986","journal-title":"Rivista di Informatica"},{"issue":"4","key":"10.1016\/0304-3975(92)90389-W_BIB33","article-title":"Soddisfacimento di vincoli e allocazione di risorse condivise: un algoritmo polinomiale deterministico","volume":"XVII","author":"Monfroglio","year":"1987","journal-title":"Rivista di Informatica A.I.C.A."},{"key":"10.1016\/0304-3975(92)90389-W_BIB34","article-title":"A graphical interface to logic programming","volume":"101","author":"Monfroglio","year":"1987","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0304-3975(92)90389-W_BIB35","article-title":"A general logic constraint solver, operations research and artificial intelligence","author":"Monfroglio","year":"1988","journal-title":"A.I.R.O. Pisa"},{"key":"10.1016\/0304-3975(92)90389-W_BIB36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0169-023X(88)90002-X","article-title":"Timetabling through a deductive data base, a case study","volume":"3","author":"Monfroglio","year":"1988","journal-title":"Data knowl. Eng."},{"key":"10.1016\/0304-3975(92)90389-W_BIB37","article-title":"Efficient logic constraint satisfaction","author":"Monfroglio","year":"1989","journal-title":"Atti Congresso Annuale A.I.C.A."},{"key":"10.1016\/0304-3975(92)90389-W_BIB38","article-title":"General heuristics for logic constraint satisfaction","author":"Monfroglio","year":"1989","journal-title":"Proc. 1st AIIA Conf."},{"key":"10.1016\/0304-3975(92)90389-W_BIB39","article-title":"Un algoritmo per il problema del Commesso Viaggiatore basato sull'Allocazione di Risorse Condivise","volume":"4","author":"Monfroglio","year":"1989","journal-title":"Rivista di Informatica A.I.C.A."},{"key":"10.1016\/0304-3975(92)90389-W_BIB40","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0925-2312(91)90018-7","article-title":"Connectionist networks for constraint satisfaction","volume":"3","author":"Monfroglio","year":"1991","journal-title":"Neurocomput"},{"key":"10.1016\/0304-3975(92)90389-W_BIB41","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: fundamental properties and applications in picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/0304-3975(92)90389-W_BIB42","series-title":"Proc. 1st Internat. Conf. of Knowledge Representation and Reasoning","article-title":"Exact solution in linear time of network of constraints using perfect relaxation","author":"Montanari","year":"1989"},{"key":"10.1016\/0304-3975(92)90389-W_BIB43","article-title":"A graphical interface for linear programming","volume":"32","author":"Pai-chun","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90389-W_BIB44","article-title":"The complexity of facets","author":"Papadimitriou","year":"1982","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90389-W_BIB45","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"key":"10.1016\/0304-3975(92)90389-W_BIB46","article-title":"Artificial intelligence\u2014An overview of similarities with O.R.","volume":"37","author":"Phelps","year":"1986","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0304-3975(92)90389-W_BIB47","doi-asserted-by":"crossref","DOI":"10.1137\/0212049","article-title":"An analysis of backtracking with search rearrangement","volume":"12","author":"Purdom","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90389-W_BIB48","series-title":"Artificial Intelligence","author":"Rich","year":"1983"},{"key":"10.1016\/0304-3975(92)90389-W_BIB49","article-title":"Constraint satisfaction problems in logic programming","volume":"106","author":"Rossi","year":"1988","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0304-3975(92)90389-W_BIB50","doi-asserted-by":"crossref","DOI":"10.1145\/42282.46160","article-title":"The time complexity of maximum matching by simulated annealing","volume":"35","author":"Sasaki","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90389-W_BIB51","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","author":"Seymour","year":"1980","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0304-3975(92)90389-W_BIB52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(80)90032-6","article-title":"Constraints: A language for expressing a most-hierarchical descriptions","volume":"14","author":"Sussman","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90389-W_BIB53","article-title":"Heuristic methods applied to orienteering","volume":"9","author":"Tsiligirides","year":"1984","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0304-3975(92)90389-W_BIB54","series-title":"Proc. 4th Internat. Conf. Logic Programming","article-title":"Forward checking in logic programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0304-3975(92)90389-W_BIB55","article-title":"A framework for consistency techniques in logic programming","author":"Van Hentenryck","year":"1987","journal-title":"IJCAI Proc."},{"key":"10.1016\/0304-3975(92)90389-W_BIB56","article-title":"A constraint approach to mastermind in logic programming","volume":"103","author":"Van Hentenryck","year":"1988","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0304-3975(92)90389-W_BIB57","series-title":"Logic Constraint Satisfaction","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/0304-3975(92)90389-W_BIB58","doi-asserted-by":"crossref","DOI":"10.1137\/1010063","article-title":"Integral extreme points","volume":"10","author":"Veinott","year":"1968","journal-title":"SIAM Rev."},{"key":"10.1016\/0304-3975(92)90389-W_BIB59","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290389W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290389W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:57:47Z","timestamp":1555113467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290389W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["030439759290389W"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90389-w","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}