{"id":"https://openalex.org/W3140558671","doi":"https://doi.org/10.4225/03/5993868b959cc","title":"Constraint-based Reasoning for Description Logics with Concrete Domains and Aggregations","display_name":"Constraint-based Reasoning for Description Logics with Concrete Domains and Aggregations","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W3140558671","doi":"https://doi.org/10.4225/03/5993868b959cc","mag":"3140558671"},"language":"en","primary_location":{"id":"pmh:oai:figshare.com:article/5309887","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090488531","display_name":"Wudhichart Sawangphol","orcid":"https://orcid.org/0000-0001-7872-2482"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"WUDHICHART SAWANGPHOL","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090488531"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3310012,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9987999796867371,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9987999796867371,"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.9951000213623047,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.994700014591217,"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/undecidable-problem","display_name":"Undecidable problem","score":0.8632287979125977},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8018717765808105},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6763381361961365},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6552327871322632},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.623968243598938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5997312664985657},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.5490010380744934},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5262212753295898},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.48424121737480164},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4597932994365692},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.4498148262500763},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4303416311740875},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41686180233955383},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3598548173904419},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32266855239868164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29713839292526245},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.25676339864730835},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23751133680343628},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13399913907051086}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8632287979125977},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8018717765808105},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6763381361961365},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6552327871322632},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.623968243598938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5997312664985657},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.5490010380744934},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5262212753295898},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.48424121737480164},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4597932994365692},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.4498148262500763},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4303416311740875},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41686180233955383},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3598548173904419},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32266855239868164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29713839292526245},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.25676339864730835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23751133680343628},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13399913907051086},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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":3,"locations":[{"id":"pmh:oai:figshare.com:article/5309887","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"mag:3140558671","is_oa":false,"landing_page_url":"https://bridges.monash.edu/articles/thesis/Constraint-based_Reasoning_for_Description_Logics_with_Concrete_Domains_and_Aggregations/5309887/1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"doi:10.4225/03/5993868b959cc","is_oa":true,"landing_page_url":"https://doi.org/10.4225/03/5993868b959cc","pdf_url":null,"source":{"id":"https://openalex.org/S7407052105","display_name":"Monash University","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/5309887","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W158180751","https://openalex.org/W2077031491","https://openalex.org/W2186145252","https://openalex.org/W163766553","https://openalex.org/W1599587354","https://openalex.org/W2090238417","https://openalex.org/W2106354297","https://openalex.org/W2159436396","https://openalex.org/W2250456419","https://openalex.org/W1522082107","https://openalex.org/W3132843753","https://openalex.org/W11793264","https://openalex.org/W2169091052","https://openalex.org/W2613416055","https://openalex.org/W1628187346","https://openalex.org/W1481181327","https://openalex.org/W2184746485","https://openalex.org/W2107320454","https://openalex.org/W2972694183","https://openalex.org/W2088175080"],"abstract_inverted_index":{"Aggregation":[0],"over":[1],"concrete":[2,58,123],"domains":[3,59],"is":[4,88],"a":[5,54,96],"very":[6],"natural":[7],"extension":[8,43],"to":[9,17,108],"Description":[10],"Logics":[11],"(DLs),":[12],"as":[13,31],"it":[14],"allows":[15],"individuals":[16],"be":[18],"organised":[19],"by":[20],"their":[21],"physical":[22],"attribute":[23],"values.":[24,79],"However,":[25],"reasoning":[26,67],"support":[27],"for":[28,85],"aggregations,":[29],"such":[30],"sums,":[32],"counting,":[33],"or":[34],"min/":[35],"max,":[36],"has":[37,63],"proved":[38],"challenging,":[39],"since":[40],"any":[41],"naive":[42],"will":[44],"immediately":[45],"result":[46],"in":[47],"an":[48,92],"undecidable":[49],"logic.":[50],"This":[51,105],"thesis":[52],"introduces":[53],"new":[55],"DL":[56,87],"with":[57,118],"and":[60,90,98,115,122],"aggregations":[61],"that":[62,82,113],"useful":[64],"yet":[65],"decidable":[66],"tasks.":[68],"It":[69],"therefore":[70],"enables":[71,106],"the":[72,120,126,129],"expression":[73],"of":[74,125],"complex":[75],"phenomena":[76],"involving":[77],"numerical":[78],"We":[80],"show":[81],"concept":[83],"satisfiability":[84],"this":[86],"NP-complete,":[89],"describe":[91],"implementation":[93],"based":[94],"on":[95],"sound":[97],"complete":[99],"encoding":[100],"into":[101],"Constraint":[102],"Programming":[103],"(CP).":[104],"us":[107],"exploit":[109],"efficient":[110],"CP":[111],"solvers":[112],"naturally":[114],"efficiently":[116],"deal":[117],"both":[119],"abstract":[121],"parts":[124],"logic":[127],"at":[128],"same":[130],"time.":[131]},"counts_by_year":[],"updated_date":"2026-02-12T00:53:03.260389","created_date":"2025-10-10T00:00:00"}