乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T03:57:49Z","timestamp":1720411069076},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1016\/j.artint.2015.03.002","type":"journal-article","created":{"date-parts":[[2015,3,12]],"date-time":"2015-03-12T13:50:08Z","timestamp":1426168208000},"page":"1-27","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty"],"prefix":"10.1016","volume":"224","author":[{"given":"Alessandro","family":"Cimatti","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Micheli","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9483-3940","authenticated-orcid":false,"given":"Marco","family":"Roveri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/j.artint.2015.03.002_br0010","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","article-title":"Maintaining knowledge about temporal intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Commun. ACM"},{"key":"10.1016\/j.artint.2015.03.002_br0020","series-title":"ECP","first-page":"97","article-title":"SAT-based procedures for temporal reasoning","author":"Armando","year":"1999"},{"issue":"1","key":"10.1016\/j.artint.2015.03.002_br0030","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.artint.2015.03.002_br0040","series-title":"Handbook of Satisfiability","first-page":"825","article-title":"Satisfiability modulo theories","author":"Barrett","year":"2009"},{"key":"10.1016\/j.artint.2015.03.002_br0050","series-title":"CAV","first-page":"335","article-title":"Efficient satisfiability modulo theories via delayed theory combination","author":"Bozzano","year":"2005"},{"key":"10.1016\/j.artint.2015.03.002_br0060","series-title":"TACAS","first-page":"150","article-title":"The OpenSMT solver","author":"Bruttomesso","year":"2010"},{"key":"10.1016\/j.artint.2015.03.002_br0070","series-title":"TACAS","first-page":"93","article-title":"The MathSAT5 SMT solver","author":"Cimatti","year":"2013"},{"key":"10.1016\/j.artint.2015.03.002_br0080","series-title":"TIME","article-title":"Sound-and-complete algorithms for checking the dynamic controllability of temporal networks with uncertainty, disjunction and observation","author":"Cimatti","year":"2014"},{"key":"10.1016\/j.artint.2015.03.002_br0090","series-title":"AAAI","first-page":"2242","article-title":"Using timed game automata to synthesize execution strategies for simple temporal networks with uncertainty","author":"Cimatti","year":"2014"},{"key":"10.1016\/j.artint.2015.03.002_br0100","series-title":"AAAI","article-title":"Solving temporal problems using SMT: weak controllability","author":"Cimatti","year":"2012"},{"key":"10.1016\/j.artint.2015.03.002_br0110","article-title":"Solving strong controllability of temporal problems with uncertainty using SMT","author":"Cimatti","year":"2014","journal-title":"Constraints"},{"issue":"3","key":"10.1016\/j.artint.2015.03.002_br0120","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","article-title":"Partial cylindrical algebraic decomposition for quantifier elimination","volume":"12","author":"Collins","year":"1991","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.artint.2015.03.002_br0130","series-title":"FORMATS\/FTRTFT","first-page":"263","article-title":"Some progress in satisfiability checking for difference logic","author":"Cotton","year":"2004"},{"key":"10.1016\/j.artint.2015.03.002_br0140","series-title":"Geometry Revisited","first-page":"51","article-title":"Collinearity and concurrence","author":"Coxeter","year":"1967"},{"issue":"7","key":"10.1016\/j.artint.2015.03.002_br0150","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/j.artint.2015.03.002_br0160","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.entcs.2008.04.079","article-title":"Model-based theory combination","volume":"198","author":"de Moura","year":"2008","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.artint.2015.03.002_br0170","series-title":"TACAS","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"de Moura","year":"2008"},{"issue":"1\u20133","key":"10.1016\/j.artint.2015.03.002_br0180","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2015.03.002_br0190","author":"Dutertre"},{"issue":"1\u20133","key":"10.1016\/j.artint.2015.03.002_br0200","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(95)00075-8","article-title":"Simplexity of the cube","volume":"158","author":"Hughes","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.artint.2015.03.002_br0210","series-title":"TIME","first-page":"155","article-title":"Fixing the semantics for dynamic controllability and providing a more practical characterization of dynamic execution strategies","author":"Hunsberger","year":"2009"},{"key":"10.1016\/j.artint.2015.03.002_br0220","series-title":"TIME","first-page":"121","article-title":"A fast incremental algorithm for managing the execution of dynamically controllable temporal networks","author":"Hunsberger","year":"2010"},{"key":"10.1016\/j.artint.2015.03.002_br0230","series-title":"SAT","first-page":"195","article-title":"Efficient Term-ITE conversion for satisfiability modulo theories","author":"Kim","year":"2009"},{"key":"10.1016\/j.artint.2015.03.002_br0240","series-title":"Mathematical Logic","author":"Kleene","year":"1967"},{"issue":"5","key":"10.1016\/j.artint.2015.03.002_br0250","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1093\/comjnl\/36.5.450","article-title":"Applying linear quantifier elimination","volume":"36","author":"Loos","year":"1993","journal-title":"Comput. J."},{"key":"10.1016\/j.artint.2015.03.002_br0260","series-title":"LPAR","first-page":"243","article-title":"A quantifier elimination algorithm for linear real arithmetic","author":"Monniaux","year":"2008"},{"key":"10.1016\/j.artint.2015.03.002_br0270","series-title":"CP","first-page":"375","article-title":"A structural characterization of temporal dynamic controllability","author":"Morris","year":"2006"},{"key":"10.1016\/j.artint.2015.03.002_br0280","series-title":"AAAI","first-page":"1193","article-title":"Temporal dynamic controllability revisited","author":"Morris","year":"2005"},{"key":"10.1016\/j.artint.2015.03.002_br0290","series-title":"IJCAI","first-page":"494","article-title":"Dynamic control of plans with temporal uncertainty","author":"Morris","year":"2001"},{"key":"10.1016\/j.artint.2015.03.002_br0300","series-title":"DAC","first-page":"530","article-title":"Engineering an efficient SAT solver","author":"Moskewicz","year":"2001"},{"issue":"2","key":"10.1016\/j.artint.2015.03.002_br0310","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","article-title":"Simplification by cooperating decision procedures","volume":"1","author":"Nelson","year":"1979","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/j.artint.2015.03.002_br0320","series-title":"CP","first-page":"856","article-title":"Strong controllability of disjunctive temporal problems with uncertainty","author":"Peintner","year":"2007"},{"key":"10.1016\/j.artint.2015.03.002_br0330","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1998"},{"issue":"3\u20134","key":"10.1016\/j.artint.2015.03.002_br0340","first-page":"141","article-title":"Lazy satisfiability modulo theories","volume":"3","author":"Sebastiani","year":"2007","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"10.1016\/j.artint.2015.03.002_br0350","series-title":"IJCAR","first-page":"484","article-title":"Optimization in SMT with LA(Q) cost functions","author":"Sebastiani","year":"2012"},{"issue":"1\u20132","key":"10.1016\/j.artint.2015.03.002_br0360","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(03)00113-9","article-title":"Efficient solution techniques for disjunctive temporal reasoning problems","volume":"151","author":"Tsamardinos","year":"2003","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2015.03.002_br0370","series-title":"COPLAS","article-title":"Weak and dynamic controllability of temporal problems with disjunctions and uncertainty","author":"Venable","year":"2010"},{"issue":"1","key":"10.1016\/j.artint.2015.03.002_br0380","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/095281399146607","article-title":"Handling contingency in temporal constraint networks: from consistency to controllabilities","volume":"11","author":"Vidal","year":"1999","journal-title":"J. Exp. Theor. Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370215000405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370215000405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T22:01:18Z","timestamp":1561932078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370215000405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":38,"alternative-id":["S0004370215000405"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2015.03.002","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2015.03.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}