{"id":"https://openalex.org/W7096467028","doi":null,"title":"Constraint-based Methods in Object-Oriented Programming Environments (Extended Abstract)","display_name":"Constraint-based Methods in Object-Oriented Programming Environments (Extended Abstract)","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7096467028"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.4556","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.4556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unipd.it/~frossi/ringwelski.ps.gz","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7096467028"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5076867246","display_name":"Georg Ringwelski","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Georg Ringwelski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5076867246"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9839000105857849,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9839000105857849,"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/T10126","display_name":"Logic, programming, and type systems","score":0.01119999960064888,"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/T10533","display_name":"Teaching and Learning Programming","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/constraint-programming","display_name":"constraint programming","score":0.9900000095367432},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.9330000281333923},{"id":"https://openalex.org/keywords/object-oriented-programming","display_name":"object-oriented programming","score":0.925000011920929},{"id":"https://openalex.org/keywords/declarative-problem-solving","display_name":"declarative problem solving","score":0.8500000238418579},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7319999933242798},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.8090000152587891}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.8747000098228455},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8011999726295471},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.7077999711036682},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6991999745368958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6572999954223633},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6220999956130981},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.557200014591217},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4975000023841858},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.48089998960494995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4562999904155731},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4138000011444092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36649999022483826},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35679998993873596},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.3379000127315521},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.3122999966144562},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.30329999327659607},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.2955999970436096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29440000653266907},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C529173508","wikidata":"https://www.wikidata.org/wiki/Q638608","display_name":"Software development","level":3,"score":0.2766000032424927}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.4556","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.4556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unipd.it/~frossi/ringwelski.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7100196049","https://openalex.org/W7096959181","https://openalex.org/W2182639291","https://openalex.org/W2151910354","https://openalex.org/W2013398477","https://openalex.org/W69961269","https://openalex.org/W7008722911","https://openalex.org/W7095817567","https://openalex.org/W7097202512","https://openalex.org/W2500041535"],"abstract_inverted_index":{"1":[0],"Motivation":[1],"Since":[2],"the":[3,38,68,71,74,103],"early":[4],"1980s":[5],"Constraint":[6,27],"Programming":[7],"(CP":[8],"for":[9,31,102],"short)":[10,32],"has":[11],"emerged":[12],"an":[13,45],"adequate":[14],"means":[15],"to":[16,49,81],"implement":[17],"and":[18,73,93],"solve":[19],"many":[20,90],"problems":[21,113],"known":[22,126],"from":[23,70],"Arti":[24],"cial":[25],"Intelligence.":[26],"Satisfaction":[28],"Problems":[29],"(CSP":[30],"can":[33,114],"be":[34,115],"solved":[35,116],"by":[36],"stating":[37],"problem":[39],"itself":[40],"instead":[41],"of":[42,67,77,105],"de":[43],"ning":[44],"algorithm":[46],"that":[47,63],"is":[48,107],"nd":[50],"a":[51,58,65],"solution.":[52],"The":[53],"constraints":[54,72],"are":[55,87],"posted":[56],"in":[57,89,95,127],"domain":[59],"speci":[60],"c":[61],"solver":[62],"infers":[64],"solution":[66],"CSP":[69],"possible":[75],"values":[76],"constraint":[78,84,119],"variables.":[79],"Due":[80],"this":[82],"declarativity":[83],"based":[85,120],"methods":[86,121],"used":[88],"academic":[91],"applications":[92],"even":[94],"some":[96],"professional":[97],"software":[98],"systems.":[99],"Another":[100],"reason":[101],"success":[104],"CP":[106],"its":[108],"eciency.":[109],"Many":[110],"combinatorial":[111],"NP-hard":[112],"faster":[117],"with":[118,123],"than":[122],"other":[124],"algorithms":[125],"AI.":[128]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}