{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:57:16Z","timestamp":1648904236314},"reference-count":67,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Decision Support Systems"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0167-9236(94)90076-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"259-281","source":"Crossref","is-referenced-by-count":1,"title":["Logic decisions under constraints"],"prefix":"10.1016","volume":"11","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9236(94)90076-0_BIB1","series-title":"Pandora: Non-deterministic Parallel Logic Programming","author":"Bahgat","year":"1988"},{"key":"10.1016\/0167-9236(94)90076-0_BIB2","series-title":"Nonlinear Programming 2","first-page":"279","article-title":"Disjunctive Programming: Cutting Planes from Logical Conditions","author":"Balas","year":"1975"},{"key":"10.1016\/0167-9236(94)90076-0_BIB3","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/0167-9236(94)90076-0_BIB4","series-title":"Hypergraphs","author":"Berge","year":"1989"},{"key":"10.1016\/0167-9236(94)90076-0_BIB5","series-title":"Advanced Techniques in O.R.","first-page":"333","article-title":"Matroids and Operations Research","author":"Bixby","year":"1982"},{"key":"10.1016\/0167-9236(94)90076-0_BIB6","doi-asserted-by":"crossref","first-page":"12","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\/0167-9236(94)90076-0_BIB7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0195-6698(85)80031-7","article-title":"Cutting Planes in Combinatorics","volume":"6","author":"Chvatal","year":"1985","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/0167-9236(94)90076-0_BIB8","series-title":"Proc. 3rd ann. ACM Symp. Theory Comput.","first-page":"151","article-title":"The Complexity of Theorem Proving Procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0167-9236(94)90076-0_BIB9","series-title":"Artificial Intelligence","article-title":"Planning and Operation Research","author":"Daniel","year":"1983"},{"issue":"1","key":"10.1016\/0167-9236(94)90076-0_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":"vol. 34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/0167-9236(94)90076-0_BIB11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree Clustering for Constraint Networks","volume":"Vol. 38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/0167-9236(94)90076-0_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 Cutest Decomposition","volume":"vol. 41","author":"Dechter","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0167-9236(94)90076-0_BIB13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/77481.77485","article-title":"Integer Programming vs. Expert System: An Experimental Comparison","author":"Dhar","year":"1990","journal-title":"CACM"},{"key":"10.1016\/0167-9236(94)90076-0_BIB14","series-title":"Proceedings of the 5th International Conference and Symposium on Logic Programming","first-page":"42","article-title":"Solving a cutting-stock problem in Constraint Logic Programming","author":"Dincbas","year":"1988"},{"key":"10.1016\/0167-9236(94)90076-0_BIB15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum Matching and Polyhedron With 0,1-Vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"Journal of Research of the National Bureau of Standards(B)"},{"key":"10.1016\/0167-9236(94)90076-0_BIB16","series-title":"Proceedings of ECAI'90","article-title":"why is scheduling difficult? A CSP perspective","author":"Fox","year":"1990"},{"key":"10.1016\/0167-9236(94)90076-0_BIB17","article-title":"Problem Topology, texture and Objectives","volume":"Vol. III","author":"Fox","year":"1991","journal-title":"AIIA News"},{"key":"10.1016\/0167-9236(94)90076-0_BIB18","article-title":"Probabilistic analysis of the Davis Putman procedure for solving the satisfiability problem","volume":"Vol. 5","author":"France","year":"1983","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/0167-9236(94)90076-0_BIB19","doi-asserted-by":"crossref","first-page":"24","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\/0167-9236(94)90076-0_BIB20","series-title":"Journal of Logic Programming","article-title":"Algorithms for Testing the Satisfiability of Propositional Formulae","author":"Gallio","year":"1989"},{"key":"10.1016\/0167-9236(94)90076-0_BIB21","series-title":"Computer and Intractibility","author":"Garey","year":"1979"},{"key":"10.1016\/0167-9236(94)90076-0_BIB22","series-title":"Recent Advances in Mathematical Programming","first-page":"269","article-title":"An Algorithm for Integer Solutions to Linear Programs","author":"Gomory","year":"1963"},{"issue":"1","key":"10.1016\/0167-9236(94)90076-0_BIB23","doi-asserted-by":"crossref","first-page":"41","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":"Journal of the Operational Research Society"},{"key":"10.1016\/0167-9236(94)90076-0_BIB24","series-title":"Linear Inequalities an Related Systems","first-page":"223","article-title":"Integral Boundary Points of Convex Polyhedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/0167-9236(94)90076-0_BIB25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"The matching problem for bipartite graphs","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-9236(94)90076-0_BIB26","series-title":"Discrete Algorithms and Complexity","first-page":"223","article-title":"Complementary Approaches to CNF Boolean Equations","author":"Iwama","year":"1987"},{"key":"10.1016\/0167-9236(94)90076-0_BIB27","series-title":"Proceeding of the Conference on Principles of Programming Languages","article-title":"Constraint Logic Programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/0167-9236(94)90076-0_BIB28","series-title":"Proceedings of the 16th Annual ACM Symposium on Theory of Computing","first-page":"302","article-title":"A New Polynomial Time Algorithm for Linear Programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/0167-9236(94)90076-0_BIB29","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility Among Combinatorial Problems","author":"Karp","year":"1972"},{"key":"10.1016\/0167-9236(94)90076-0_BIB30","first-page":"191","article-title":"A Polynomial Algorithm for Linear Programming","author":"Khachian","year":"1979","journal-title":"Soviet Mathematics Dklady, Nauk USSR"},{"key":"10.1016\/0167-9236(94)90076-0_BIB31","first-page":"65","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problem","volume":"Vol. 25","author":"Mackworth","year":"1985","journal-title":"A.I."},{"key":"10.1016\/0167-9236(94)90076-0_BIB32","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","article-title":"Optimization Decision Trees Through Heuristically Guided Search","volume":"Vol. 21","author":"Martelli","year":"1978","journal-title":"CACM"},{"key":"10.1016\/0167-9236(94)90076-0_BIB33","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/0212022","article-title":"Towards a Genuinely Polynomial Algorithm for Linear Programming","volume":"V. 12","author":"Megiddo","year":"1983","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/0167-9236(94)90076-0_BIB34","series-title":"Proceedings of the 21st Annual Symposium on the Foundation of Computer Science","first-page":"17","article-title":"An algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0167-9236(94)90076-0_BIB35","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/15715.15716","article-title":"School Time Table Scheduling in Prolog","author":"Monfroglio","year":"1986","journal-title":"SIGART newsletter"},{"key":"10.1016\/0167-9236(94)90076-0_BIB36","first-page":"353","article-title":"Soddisfacimento di vincoli e programmazione logica parallela","volume":"Vol. XVI","author":"Monfroglio","year":"1986","journal-title":"Rivista di informatica"},{"key":"10.1016\/0167-9236(94)90076-0_BIB37","first-page":"307","article-title":"Soddisfacimento di vincoli e allocazione di risorse condvise: un algoritmo polinomiale deterministico","volume":"Vol. XVII","author":"Monfroglio","year":"1987","journal-title":"Rivista di Informatica, A.I.C.A."},{"key":"10.1016\/0167-9236(94)90076-0_BIB38","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/29264.29267","article-title":"A graphical interface to logic programming","author":"Monfroglio","year":"1987","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0167-9236(94)90076-0_BIB39","first-page":"29","article-title":"A General Logic Constraint Solver","author":"Monfroglio","year":"1988","journal-title":"Operations Research and Artificial Intelligence, A.I.R.O. Pisa"},{"key":"10.1016\/0167-9236(94)90076-0_BIB40","series-title":"Data & Knowledge Engineering","first-page":"1","article-title":"Timetabling through a deductive data base, a case study","author":"Monfroglio","year":"1988"},{"key":"10.1016\/0167-9236(94)90076-0_BIB41","series-title":"Atti Congresso Annuale A.I.C.A.","first-page":"167","article-title":"Efficient Logic Constraint Satisfaction","author":"Monfroglio","year":"1989"},{"key":"10.1016\/0167-9236(94)90076-0_BIB42","series-title":"Proceedings of the first AIIA Conference","first-page":"306","article-title":"General Heuristics for Logic Constraint Satisfaction","author":"Monfroglio","year":"1989"},{"key":"10.1016\/0167-9236(94)90076-0_BIB43","first-page":"359","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\/0167-9236(94)90076-0_BIB44","first-page":"29","article-title":"Connectionist networks for constraint satisfaction","volume":"3","author":"Monfroglio","year":"1991"},{"key":"10.1016\/0167-9236(94)90076-0_BIB45","series-title":"Theoretical Computer Science","first-page":"105","article-title":"Integer programs for logic constraint satisfaction","volume":"vol. 97","author":"Monfroglio","year":"1992"},{"key":"10.1016\/0167-9236(94)90076-0_BIB46","doi-asserted-by":"crossref","first-page":"95","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\/0167-9236(94)90076-0_BIB47","series-title":"Proceedings of the first international conference 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\/0167-9236(94)90076-0_BIB48","first-page":"143","article-title":"Constraint relaxation may be perfect","volume":"Vol. 48","author":"Montanari","year":"1991"},{"key":"10.1016\/0167-9236(94)90076-0_BIB49","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1145\/65971.65978","article-title":"A Graphical Interface for Linear Programming","volume":"Vol. 32","author":"Pai-chun","year":"1989","journal-title":"CACM"},{"key":"10.1016\/0167-9236(94)90076-0_BIB50","series-title":"Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing","first-page":"244","article-title":"The Complexity of Facets (and Some Facets of Complexity)","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0167-9236(94)90076-0_BIB51","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"issue":"1","key":"10.1016\/0167-9236(94)90076-0_BIB52","first-page":"13","article-title":"Artificial Intelligence\u2014An Overview of Similarities with O.R.","volume":"37","author":"Phelps","year":"1986","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/0167-9236(94)90076-0_BIB53","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1137\/0212049","article-title":"An analysis of backtracking with research rearrangement","volume":"12","author":"Purdom","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-9236(94)90076-0_BIB54","author":"Rich","year":"1983"},{"key":"10.1016\/0167-9236(94)90076-0_BIB55","doi-asserted-by":"crossref","DOI":"10.1145\/54350.54352","article-title":"Constraint Satisfaction Problems in Logic Programming","author":"Rossi","year":"1988","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0167-9236(94)90076-0_BIB56","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/42282.46160","article-title":"The time complexity of Maximum Matching by Simulated Annealing","volume":"Vol. 35","author":"Sasaki","year":"1988","journal-title":"Journal of ACM"},{"key":"10.1016\/0167-9236(94)90076-0_BIB57","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of Regular Matroids","author":"Seymour","year":"1980","journal-title":"Journal of Combinatorial Theory"},{"key":"10.1016\/0167-9236(94)90076-0_BIB58","series-title":"Algebraic and Logic Programming, 2nd Int. Conf.","first-page":"189","article-title":"Propositional Calculus Problems in CHIP","author":"Simonis","year":"1990"},{"key":"10.1016\/0167-9236(94)90076-0_BIB59","series-title":"Note di Software","article-title":"Artificial Intelligence and Complex Dynamics","author":"Steels","year":"1988"},{"key":"10.1016\/0167-9236(94)90076-0_BIB60","article-title":"Constraints: A Language for Expressing A most-Hierarchical Descriptions","volume":"Vol. 14","author":"Sussman","year":"1980","journal-title":"A.I."},{"key":"10.1016\/0167-9236(94)90076-0_BIB61","article-title":"Heuristic Methods Applied to Orienteering","volume":"9","author":"Tsiligirides","year":"1984","journal-title":"J. Op. Res. Soc."},{"key":"10.1016\/0167-9236(94)90076-0_BIB62","series-title":"Fourth International Conference on Logic Programming, Proc.","first-page":"229","article-title":"Forward checking in Logic Programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0167-9236(94)90076-0_BIB63","series-title":"IJCAI Proc.","first-page":"2","article-title":"A Framework for Consistency Techniques in Logic Programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0167-9236(94)90076-0_BIB64","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/44418.44421","article-title":"A Constraint Approach to Mastermind in Logic Programming","author":"Van Hentenryck","year":"1988","journal-title":"SIGART Newsletter"},{"key":"10.1016\/0167-9236(94)90076-0_BIB65","series-title":"Constraint Satisfaction in Logic Programming","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/0167-9236(94)90076-0_BIB66","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/1010063","article-title":"Integral Extreme Points","volume":"10","author":"Veinott","year":"1968","journal-title":"SIAM Review"},{"key":"10.1016\/0167-9236(94)90076-0_BIB67","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Decision Support Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167923694900760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167923694900760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T15:56:31Z","timestamp":1552924591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167923694900760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0167923694900760"],"URL":"https:\/\/doi.org\/10.1016\/0167-9236(94)90076-0","relation":{},"ISSN":["0167-9236"],"issn-type":[{"value":"0167-9236","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}