{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:57:03Z","timestamp":1781107023737,"version":"3.54.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:00:00Z","timestamp":1778544000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Robotics and Autonomous Systems"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.robot.2026.105522","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:54:33Z","timestamp":1778547273000},"page":"105522","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["GEO-SAT: A new approach for knowledge-based agent decision making"],"prefix":"10.1016","volume":"203","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0792-3882","authenticated-orcid":false,"given":"Thomas C.","family":"Henderson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amelia","family":"Lessen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ishaan","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tessa","family":"Nishida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kutay","family":"Eken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiuyi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Sacharny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amar","family":"Mitiche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thatcher","family":"Geary","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.robot.2026.105522_b1","series-title":"Introduction to the Theory of Computation","author":"Sipser","year":"2012"},{"key":"10.1016\/j.robot.2026.105522_b2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","article-title":"Probabilistic satisfiability","volume":"4","author":"Georgakopoulos","year":"1988","journal-title":"J. Complexity"},{"key":"10.1016\/j.robot.2026.105522_b3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic logic","volume":"28","author":"Nilsson","year":"1986","journal-title":"Artif. Intell. J."},{"key":"10.1016\/j.robot.2026.105522_b4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.artint.2019.103199","article-title":"Probabilistic sentence satisfiability: An approach to PSAT","volume":"278","author":"Henderson","year":"2020","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.robot.2026.105522_b5","series-title":"Probabilistic Reasoning in Intelligent Systems","author":"Pearl","year":"1988"},{"key":"10.1016\/j.robot.2026.105522_b6","series-title":"Markov Logic Networks","author":"Domingos","year":"2009"},{"key":"10.1016\/j.robot.2026.105522_b7","series-title":"Some explorations in SAT","author":"Henderson","year":"2021"},{"key":"10.1016\/j.robot.2026.105522_b8","doi-asserted-by":"crossref","unstructured":"Thomas C. Henderson, David Sacharny, Amar Mitiche, Xiuyi Fan, Amelia Lessen, Ishaan Rajan, Tessa Nishida, Chop-SAT: A New Approach to Solving SAT and Probabilistic SAT for Agent Knowledge Bases, in: International Conference on Agents and Artificial Intelligence, Lisbon, Spain, 2023.","DOI":"10.5220\/0011614400003393"},{"issue":"5","key":"10.1016\/j.robot.2026.105522_b9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","article-title":"Outline of an algorithm for integer solution to linear programs","volume":"64","author":"Gomory","year":"1958","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.robot.2026.105522_b10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01845704","article-title":"Cutting Planes, Connectivity, and Threshold Logic","volume":"35","author":"Buss","year":"1996","journal-title":"Arch. Math. Log."},{"key":"10.1016\/j.robot.2026.105522_b11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chvatal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/j.robot.2026.105522_b12","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 J. Combin."},{"key":"10.1016\/j.robot.2026.105522_b13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","article-title":"On the complexity of cutting-plane proofs","volume":"18","author":"Cook","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.robot.2026.105522_b14","series-title":"Thirty-Fift AAAI Conference on Artificial Intelligence","article-title":"Cutting to the core of psuedo-boolean optimization: Combining core-guided search with cutting planes reasoning","author":"Devriendt","year":"2021"},{"key":"10.1016\/j.robot.2026.105522_b15","series-title":"GEO-SAT: A geometric approach to satisfiability","author":"Henderson","year":"2023"},{"issue":"1","key":"10.1016\/j.robot.2026.105522_b16","doi-asserted-by":"crossref","DOI":"10.1137\/S1052623401397230","article-title":"On numerical solution of the maximum volume ellipsoid problem","volume":"14","author":"Zhang","year":"2003","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.robot.2026.105522_b17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01582241","article-title":"On the complexity of four polynomial containment problems","volume":"33","author":"Freund","year":"1985","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.robot.2026.105522_b18","first-page":"19","article-title":"A weighted projection centering method","volume":"22","author":"Moretti","year":"2003","journal-title":"Comput. Appl. Math."},{"key":"10.1016\/j.robot.2026.105522_b19","article-title":"Hunt the wumpus?","author":"Yob","year":"1975","journal-title":"Creat. Comput."},{"key":"10.1016\/j.robot.2026.105522_b20","series-title":"Artificial Intelligence: A Modern Approach","author":"Russell","year":"2009"},{"key":"10.1016\/j.robot.2026.105522_b21","series-title":"Intelligent Agents V: Agents Theories, Architectures, and Languages","first-page":"1","article-title":"The belief-desire-intention model of agency","author":"Georgeff","year":"1999"},{"key":"10.1016\/j.robot.2026.105522_b22","doi-asserted-by":"crossref","unstructured":"D. Sacharny, Thomas C. Henderson, Michael Cline, Benjamin Russon, Reinforcement Learning at the Cognitive Level in a Belief, Desire, Intention UAS Agent, in: Intelligent Autonomous Systems Conference, Singapore, 2021.","DOI":"10.1007\/978-3-030-95892-3_35"},{"key":"10.1016\/j.robot.2026.105522_b23","series-title":"Convex Optimization","author":"Boyd","year":"2021"}],"container-title":["Robotics and Autonomous Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0921889026001958?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0921889026001958?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:59:39Z","timestamp":1781103579000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0921889026001958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":23,"alternative-id":["S0921889026001958"],"URL":"https:\/\/doi.org\/10.1016\/j.robot.2026.105522","relation":{},"ISSN":["0921-8890"],"issn-type":[{"value":"0921-8890","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GEO-SAT: A new approach for knowledge-based agent decision making","name":"articletitle","label":"Article Title"},{"value":"Robotics and Autonomous Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.robot.2026.105522","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"105522"}}