{"id":"https://openalex.org/W2048903787","doi":"https://doi.org/10.1109/iros.2013.6697046","title":"Using incomplete satisfiability modulo theories to determine robotic tasks","display_name":"Using incomplete satisfiability modulo theories to determine robotic tasks","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2048903787","doi":"https://doi.org/10.1109/iros.2013.6697046","mag":"2048903787"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2013.6697046","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2013.6697046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047626717","display_name":"Andreas Witsch","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Witsch","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]},{"raw_affiliation_string":"Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025622214","display_name":"Hendrik Skubch","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hendrik Skubch","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]},{"raw_affiliation_string":"Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063513367","display_name":"Stefan Niemczyk","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Niemczyk","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]},{"raw_affiliation_string":"Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077860593","display_name":"Kurt Geihs","orcid":"https://orcid.org/0000-0001-9833-6108"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kurt Geihs","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]},{"raw_affiliation_string":"Fac. of Electr. Eng. & Comput. Sci., Univ. of Kassel, Kassel, Germany","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":null,"apc_paid":null,"fwci":0.2683,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.45882858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"4784","last_page":"4789"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7909070253372192},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.785533607006073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6968803405761719},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.638081967830658},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5970823764801025},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5772980451583862},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5628427863121033},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5600721836090088},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5553848147392273},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5333426594734192},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.4959202706813812},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4929370880126953},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.41980960965156555},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33199837803840637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19726786017417908},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09815940260887146}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7909070253372192},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.785533607006073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6968803405761719},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.638081967830658},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5970823764801025},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5772980451583862},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5628427863121033},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5600721836090088},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5553848147392273},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5333426594734192},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.4959202706813812},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4929370880126953},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.41980960965156555},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33199837803840637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19726786017417908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09815940260887146},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2013.6697046","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2013.6697046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.714.999","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://carpenoctem.das-lab.net/sites/default/files/biblio/iros13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W627053101","https://openalex.org/W1480909796","https://openalex.org/W1551063802","https://openalex.org/W1581065673","https://openalex.org/W1868145863","https://openalex.org/W2022846948","https://openalex.org/W2036265926","https://openalex.org/W2043453303","https://openalex.org/W2048051309","https://openalex.org/W2062897452","https://openalex.org/W2086163366","https://openalex.org/W2101741218","https://openalex.org/W2137808436","https://openalex.org/W2142785340","https://openalex.org/W2155218845","https://openalex.org/W2157488300","https://openalex.org/W2158859403","https://openalex.org/W2163850966","https://openalex.org/W2560525892","https://openalex.org/W3148608205","https://openalex.org/W3176583243","https://openalex.org/W6619828613","https://openalex.org/W6633062574","https://openalex.org/W6638960455","https://openalex.org/W6797154290"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W4312622265","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W4379142300","https://openalex.org/W4302330337","https://openalex.org/W2091617677","https://openalex.org/W1945774704","https://openalex.org/W1505872263","https://openalex.org/W1583293909"],"abstract_inverted_index":{"Many":[0],"robotic":[1],"task":[2,72],"specifications":[3],"can":[4],"be":[5],"naturally":[6],"expressed":[7],"by":[8],"boolean":[9],"combinations":[10],"of":[11,18],"arbitrary":[12],"constraints.":[13],"This":[14],"allows":[15],"a":[16,29],"separation":[17],"problem":[19],"description":[20],"and":[21],"solution":[22,61],"strategy.":[23,55],"In":[24],"this":[25,57],"paper,":[26],"we":[27,48],"present":[28],"novel":[30],"approach":[31,81],"to":[32,64,84,89],"solve":[33,90],"non-linear":[34],"constraint":[35],"systems":[36],"based":[37],"on":[38],"Satisfiability":[39],"Modulo":[40],"Theories.":[41],"While":[42],"most":[43],"SMT-based":[44],"techniques":[45],"emphasize":[46],"completeness,":[47],"intentionally":[49],"use":[50],"an":[51],"incomplete":[52],"local":[53],"search":[54],"Despite":[56],"incompleteness,":[58],"the":[59,86],"presented":[60],"is":[62,82],"able":[63,83],"deal":[65],"with":[66],"many":[67],"real":[68],"world":[69],"problems":[70],"like":[71],"allocation":[73],"or":[74],"robot":[75],"positioning.":[76],"We":[77],"show":[78],"that":[79],"our":[80],"exploit":[85],"logical":[87],"structure":[88],"highly":[91],"complex":[92],"tasks":[93],"almost":[94],"in":[95],"real-time.":[96]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}