iBet uBet
web content aggregator. Adding the entire web to your favor.
Link to original content:
https://api.openalex.org/works/doi:10.1109/ICTAI.2018.00026
{"id":"https://openalex.org/W2900120698","doi":"https://doi.org/10.1109/ictai.2018.00026","title":"Stratified Constructive Disjunction and Negation in Constraint Programming","display_name":"Stratified Constructive Disjunction and Negation in Constraint Programming","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2900120698","doi":"https://doi.org/10.1109/ictai.2018.00026","mag":"2900120698"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictai.2018.00026","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/A5013313145","display_name":"Arnaud Gotlieb","orcid":"https://orcid.org/0000-0002-8980-7585"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Arnaud Gotlieb","raw_affiliation_strings":["Simula Res. Lab., Lysaker, Norway"],"affiliations":[{"raw_affiliation_string":"Simula Res. Lab., Lysaker, Norway","institution_ids":["https://openalex.org/I2799829267"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056500610","display_name":"Dusica Marijan","orcid":"https://orcid.org/0000-0001-9345-5431"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Dusica Marijan","raw_affiliation_strings":["Simula Res. Lab., Lysaker, Norway"],"affiliations":[{"raw_affiliation_string":"Simula Res. Lab., Lysaker, Norway","institution_ids":["https://openalex.org/I2799829267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005226780","display_name":"Helge Spieker","orcid":"https://orcid.org/0000-0003-2494-4279"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Helge Spieker","raw_affiliation_strings":["Simula Res. Lab., Lysaker, Norway"],"affiliations":[{"raw_affiliation_string":"Simula Res. Lab., Lysaker, Norway","institution_ids":["https://openalex.org/I2799829267"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.188,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.217786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":62,"max":70},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Distributed Constraint Optimization Problems and Algorithms","score":0.9988,"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":"Distributed Constraint Optimization Problems and Algorithms","score":0.9988,"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/T11450","display_name":"Model-Driven Engineering in Software Development","score":0.9872,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11010","display_name":"Logic Programming and Knowledge Representation","score":0.9868,"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/constructive","display_name":"Constructive","score":0.66854984},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.63301754},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint Logic Programming","score":0.576588},{"id":"https://openalex.org/keywords/soft-constraints","display_name":"Soft Constraints","score":0.520765},{"id":"https://openalex.org/keywords/constraint-optimization","display_name":"Constraint Optimization","score":0.510746},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer Set Programming","score":0.505277}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.67902386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.672032},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.66854984},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6470411},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.63301754},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.5669846},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.54447734},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.46269828},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45988593},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.44409925},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3548443},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.28451174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26242447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17198026},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.139202},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictai.2018.00026","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":23,"referenced_works":["https://openalex.org/W1516514454","https://openalex.org/W1557957421","https://openalex.org/W1589232796","https://openalex.org/W1685752790","https://openalex.org/W1831455817","https://openalex.org/W1990961880","https://openalex.org/W2001741024","https://openalex.org/W2012741612","https://openalex.org/W2013425250","https://openalex.org/W2023772817","https://openalex.org/W2035811095","https://openalex.org/W2058370033","https://openalex.org/W2067273780","https://openalex.org/W2077494135","https://openalex.org/W2082299789","https://openalex.org/W2089110971","https://openalex.org/W2105674619","https://openalex.org/W2170035094","https://openalex.org/W2911930731","https://openalex.org/W3015423745","https://openalex.org/W4285719527","https://openalex.org/W47957325","https://openalex.org/W627487437"],"related_works":["https://openalex.org/W2525470665","https://openalex.org/W2510050445","https://openalex.org/W2491239989","https://openalex.org/W2365168741","https://openalex.org/W2020731817","https://openalex.org/W200657494","https://openalex.org/W1596719193","https://openalex.org/W1591778271","https://openalex.org/W1591583250","https://openalex.org/W1536334038"],"abstract_inverted_index":{"Constraint":[0],"Programming":[1],"(CP)":[2],"is":[3,30,47,96,114,141],"a":[4,72,115],"powerful":[5],"declarative":[6],"programming":[7],"paradigm":[8],"combining":[9,58],"inference":[10],"and":[11,50,80,121,129,132],"search":[12],"in":[13,33,54,109],"order":[14],"to":[15,18,38,52],"find":[16],"solutions":[17],"various":[19,125],"type":[20],"of":[21,84],"constraint":[22,28,149],"systems.":[23,150],"Dealing":[24],"with":[25,143],"highly":[26],"disjunctive":[27,148],"systems":[29],"notoriously":[31],"difficult":[32],"CP.":[34],"Apart":[35],"from":[36,43,62],"trying":[37],"solve":[39],"each":[40,44],"disjunct":[41],"independently":[42],"other,":[45],"there":[46],"little":[48],"hope":[49],"effort":[51],"succeed":[53],"constructing":[55],"intermediate":[56],"results":[57,137],"the":[59],"knowledge":[60],"originating":[61],"several":[63],"disjuncts.":[64],"In":[65],"this":[66],"paper,":[67],"we":[68],"propose":[69],"If-Then-Else":[70],"(ITE),":[71],"lightweight":[73],"approach":[74],"for":[75,98,124],"implementing":[76],"stratified":[77,120],"constructive":[78,94,122],"disjunction":[79,95,128],"negation":[81],"on":[82],"top":[83],"an":[85],"existing":[86,144],"CP":[87,111],"solver,":[88],"namely":[89],"SICStus":[90],"Prolog":[91],"clpfd.":[92],"Although":[93],"known":[97],"more":[99],"than":[100],"three":[101],"decades,":[102],"it":[103],"does":[104],"not":[105],"have":[106],"straightforward":[107],"implementations":[108],"most":[110],"solvers.":[112],"ITE":[113,140],"freely":[116],"available":[117],"library":[118],"proposing":[119],"reasoning":[123],"operators,":[126],"including":[127],"negation,":[130],"implication":[131],"conditional.":[133],"Our":[134],"preliminary":[135],"experimental":[136],"show":[138],"that":[139,146],"competitive":[142],"approaches":[145],"handle":[147]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2900120698","counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2024-11-28T03:14:09.827674","created_date":"2018-11-16"}
