乐胖代购免代理版

{"id":"https://openalex.org/W2167695567","doi":"https://doi.org/10.1109/ismvl.2003.1201404","title":"New logical and complexity results for signed-SAT","display_name":"New logical and complexity results for signed-SAT","publication_year":2004,"publication_date":"2004-06-22","ids":{"openalex":"https://openalex.org/W2167695567","doi":"https://doi.org/10.1109/ismvl.2003.1201404","mag":"2167695567"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2003.1201404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","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/A5039752849","display_name":"Carlos Ans\u00f3tegui","orcid":"https://orcid.org/0000-0001-7727-2766"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"C. Ansotegui","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061148416","display_name":"Felip Many\u00e0","orcid":"https://orcid.org/0000-0002-8366-1458"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"F. Manya","raw_affiliation_strings":["Department of Computer Science, Universitat de Lleida, Lleida, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.913,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.612119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":81,"max":82},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic Programming and Knowledge Representation","score":0.9978,"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 Programming and Knowledge Representation","score":0.9978,"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":"Distributed Constraint Optimization Problems and Algorithms","score":0.9975,"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/T10126","display_name":"Program Analysis and Verification Techniques","score":0.9973,"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","display_name":"Satisfiability","score":0.6111694},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5710867},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.51657736},{"id":"https://openalex.org/keywords/modal-logics","display_name":"Modal Logics","score":0.482496},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.46511108},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46095422}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6111694},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.60436565},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5884684},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5710867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5573988},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.51657736},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.51466376},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.46511108},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46095422},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.43867835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40665832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38516846},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37891167},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29480886},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.26501322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18470716},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2003.1201404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":30,"referenced_works":["https://openalex.org/W125178576","https://openalex.org/W14839205","https://openalex.org/W1512994821","https://openalex.org/W1521053613","https://openalex.org/W1556130451","https://openalex.org/W1568287735","https://openalex.org/W1571393741","https://openalex.org/W1573910408","https://openalex.org/W1584535822","https://openalex.org/W1592643393","https://openalex.org/W1600919542","https://openalex.org/W1667614912","https://openalex.org/W1745650241","https://openalex.org/W1873470583","https://openalex.org/W1978050007","https://openalex.org/W2010880586","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2108637261","https://openalex.org/W2115196991","https://openalex.org/W2137137684","https://openalex.org/W2142785340","https://openalex.org/W2165372647","https://openalex.org/W2533858263","https://openalex.org/W27828651","https://openalex.org/W29806926","https://openalex.org/W39510960","https://openalex.org/W4250620173","https://openalex.org/W61450922","https://openalex.org/W6998002"],"related_works":["https://openalex.org/W3107131366","https://openalex.org/W2796388654","https://openalex.org/W2480084299","https://openalex.org/W2386111507","https://openalex.org/W2301405299","https://openalex.org/W2154853422","https://openalex.org/W2091617677","https://openalex.org/W2036901448","https://openalex.org/W1656268799","https://openalex.org/W1600869845"],"abstract_inverted_index":{"We":[0],"define":[1,22],"Mv-formulas":[2,30,47,78],"as":[3,14,48],"the":[4,7,37],"union":[5],"of":[6,9],"subclasses":[8],"signed":[10],"CNF":[11,18],"formulas":[12],"known":[13],"regular":[15],"and":[16,20,31,39,55,57,91],"monosigned":[17],"formulas,":[19],"then":[21],"resolution":[23],"calculi":[24],"that":[25,77,84],"are":[26,79],"refutation":[27],"complete":[28],"for":[29,36,67],"give":[32],"new":[33],"complexity":[34,90],"results":[35,70],"Horn-SAT":[38],"2-SAT":[40],"problems.":[41],"Our":[42],"goal":[43],"is":[44],"to":[45],"use":[46],"a":[49,80,86],"constraint":[50],"programming":[51],"language":[52,83],"between":[53,89],"CSP":[54],"SAT,":[56],"solve":[58],"computationally":[59],"difficult":[60],"combinatorial":[61],"problems":[62],"with":[63],"efficient":[64],"satisfiability":[65],"solvers":[66],"Mv-formulas.":[68],"The":[69],"presented":[71],"in":[72],"this":[73],"paper":[74],"provide":[75],"evidence":[76],"problem":[81],"modeling":[82],"offers":[85],"good":[87],"compromise":[88],"expressive":[92],"power.":[93]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2167695567","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2024-11-22T09:10:02.310925","created_date":"2016-06-24"}