{"id":"https://openalex.org/W282073632","doi":null,"title":"Experiments with SAT-based Answer Set Programming","display_name":"Experiments with SAT-based Answer Set Programming","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W282073632","mag":"282073632"},"language":"en","primary_location":{"id":"pmh:oai:digitalcommons.unomaha.edu:compsicfacproc-1018","doi":null,"is_oa":true,"landing_page_url":"https://digitalcommons.unomaha.edu/compsicfacproc/23","pdf_url":"https://digitalcommons.unomaha.edu/context/compsicfacproc/article/1018/viewcontent/Experiments_with_SAT_based.pdf","source":{"id":"https://openalex.org/S7407097580","display_name":"DigitalCommons@UNO","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I122266389","host_organization_name":"University of Nebraska at Omaha","host_organization_lineage":["https://openalex.org/I122266389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Proceedings & Presentations","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://digitalcommons.unomaha.edu/context/compsicfacproc/article/1018/viewcontent/Experiments_with_SAT_based.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004609930","display_name":"Enrico Giunchiglia","orcid":"https://orcid.org/0000-0001-5758-2556","observed_orcids":["https://orcid.org/0000-0001-5758-2556"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Enrico Giunchiglia","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5758-2556","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008816972","display_name":"Yuliya Lierler","orcid":"https://orcid.org/0000-0002-6146-623X","observed_orcids":["https://orcid.org/0000-0002-6146-623X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuliya Lierler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077756388","display_name":"Marco Maratea","orcid":"https://orcid.org/0000-0002-9034-2527","observed_orcids":["https://orcid.org/0000-0002-9034-2527"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marco Maratea","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9034-2527","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067087113","display_name":"Armando Tacchella","orcid":"https://orcid.org/0000-0001-9487-331X","observed_orcids":["https://orcid.org/0000-0001-9487-331X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Armando Tacchella","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9707000255584717,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9707000255584717,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.020400000736117363,"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"}},{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.0008999999845400453,"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/answer-set-programming","display_name":"answer set programming","score":0.9980000257492065},{"id":"https://openalex.org/keywords/propositional-satisfiability","display_name":"propositional satisfiability","score":0.9509999752044678},{"id":"https://openalex.org/keywords/logic-programming","display_name":"logic programming","score":0.5450000166893005}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8718976974487305},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6441575288772583},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5857151746749878},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5856649875640869},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5780667662620544},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48153334856033325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4625195264816284},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.45558246970176697},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4420093297958374},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41427505016326904},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:digitalcommons.unomaha.edu:compsicfacproc-1018","doi":null,"is_oa":true,"landing_page_url":"https://digitalcommons.unomaha.edu/compsicfacproc/23","pdf_url":"https://digitalcommons.unomaha.edu/context/compsicfacproc/article/1018/viewcontent/Experiments_with_SAT_based.pdf","source":{"id":"https://openalex.org/S7407097580","display_name":"DigitalCommons@UNO","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I122266389","host_organization_name":"University of Nebraska at Omaha","host_organization_lineage":["https://openalex.org/I122266389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Proceedings & Presentations","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.9114","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.9114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrg.dist.unige.it/~marco/Data/06lash.pdf.gz","raw_type":"text"},{"id":"mag:282073632","doi":null,"is_oa":false,"landing_page_url":"http://faculty.ist.unomaha.edu/ylierler//papers/06lash.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:digitalcommons.unomaha.edu:compsicfacproc-1018","doi":null,"is_oa":true,"landing_page_url":"https://digitalcommons.unomaha.edu/compsicfacproc/23","pdf_url":"https://digitalcommons.unomaha.edu/context/compsicfacproc/article/1018/viewcontent/Experiments_with_SAT_based.pdf","source":{"id":"https://openalex.org/S7407097580","display_name":"DigitalCommons@UNO","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I122266389","host_organization_name":"University of Nebraska at Omaha","host_organization_lineage":["https://openalex.org/I122266389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Proceedings & Presentations","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5335838926","display_name":null,"funder_award_id":"003658","funder_id":"https://openalex.org/F4320308138","funder_display_name":"Texas Higher Education Coordinating Board"}],"funders":[{"id":"https://openalex.org/F4320308138","display_name":"Texas Higher Education Coordinating Board","ror":"https://ror.org/05as1qb59"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W282073632.pdf","grobid_xml":"https://content.openalex.org/works/W282073632.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W14839205","https://openalex.org/W44611885","https://openalex.org/W58471491","https://openalex.org/W156747920","https://openalex.org/W217540047","https://openalex.org/W1481294694","https://openalex.org/W1481594011","https://openalex.org/W1484108514","https://openalex.org/W1490538910","https://openalex.org/W1516600063","https://openalex.org/W1518705996","https://openalex.org/W1551250655","https://openalex.org/W1566273688","https://openalex.org/W1594518690","https://openalex.org/W1605107773","https://openalex.org/W1605586974","https://openalex.org/W1672891595","https://openalex.org/W1694306392","https://openalex.org/W1712761282","https://openalex.org/W1766332311","https://openalex.org/W1870613593","https://openalex.org/W1976055110","https://openalex.org/W1985819576","https://openalex.org/W2004414305","https://openalex.org/W2011124182","https://openalex.org/W2011992362","https://openalex.org/W2076698873","https://openalex.org/W2119055724","https://openalex.org/W2142785340","https://openalex.org/W2152131859","https://openalex.org/W2165675194","https://openalex.org/W2166342416","https://openalex.org/W2399343913","https://openalex.org/W4212886450","https://openalex.org/W7100120274"],"related_works":["https://openalex.org/W1490538910","https://openalex.org/W7223585292","https://openalex.org/W2100699693","https://openalex.org/W170411877","https://openalex.org/W2165675194","https://openalex.org/W2166342416","https://openalex.org/W1581142181","https://openalex.org/W7097485734","https://openalex.org/W2394839833","https://openalex.org/W1555272910"],"abstract_inverted_index":{"Abstract.":[0],"Answer":[1],"Set":[2],"Programming":[3],"(ASP)":[4],"emerged":[5],"in":[6,21,35,73,75],"the":[7,31,67,70,79,104,112],"late":[8],"1990s":[9],"as":[10],"a":[11],"new":[12],"logic":[13],"programming":[14],"paradigm":[15],"which":[16],"has":[17],"been":[18],"successfully":[19],"applied":[20],"various":[22],"application":[23],"domains.":[24],"Propositional":[25],"satisfiability":[26],"(SAT)":[27],"is":[28,108],"one":[29],"of":[30,69],"most":[32,80],"studied":[33,47],"problems":[34,123,131],"Computer":[36],"Science.":[37],"ASP":[38,53],"and":[39,50,57,85,132],"SAT":[40,82],"are":[41,124],"closely":[42],"related:":[43],"Recent":[44],"works":[45],"have":[46],"their":[48],"relation,":[49],"efficient":[51],"SAT-based":[52],"solvers":[54],"(like":[55],"assat":[56],"Cmodels)":[58],"exist.":[59],"In":[60],"this":[61],"paper":[62],"we":[63],"report":[64],"about":[65],"(i)":[66],"extension":[68],"basic":[71],"procedures":[72],"Cmodels":[74,107],"order":[76],"to":[77],"incorporate":[78],"popular":[81],"reasoning":[83,113],"strategies,":[84],"(ii)":[86],"an":[87],"extensive":[88],"comparative":[89],"analysis":[90,100],"involving":[91],"also":[92],"other":[93],"state-of-the-art":[94],"answer":[95],"set":[96],"solvers.":[97],"The":[98],"experimental":[99],"points":[101],"out,":[102],"besides":[103],"fact":[105],"that":[106,111,115],"highly":[109],"competitive,":[110],"strategies":[114],"work":[116],"best":[117],"on":[118,126],"\u201csmall":[119],"but":[120,128],"hard":[121],"\u201d":[122,130],"ineffective":[125],"\u201cbig":[127],"easy":[129],"vice-versa.":[133],"1":[134]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2016-06-24T00:00:00"}