{"id":"https://openalex.org/W2034781759","doi":"https://doi.org/10.1080/088395100117034","title":"Symbolic constraints for meta-logic programming","display_name":"Symbolic constraints for meta-logic programming","publication_year":2000,"publication_date":"2000-04-01","ids":{"openalex":"https://openalex.org/W2034781759","doi":"https://doi.org/10.1080/088395100117034","mag":"2034781759"},"language":"en","primary_location":{"id":"doi:10.1080/088395100117034","is_oa":true,"landing_page_url":"https://doi.org/10.1080/088395100117034","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395100117034?download=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395100117034?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021255849","display_name":"Henning Christiansen","orcid":"https://orcid.org/0000-0003-4731-9927"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henning Christiansen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038451647","display_name":"Davide Martinenghi","orcid":"https://orcid.org/0000-0002-2726-7683"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Davide Martinenghi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.5259,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.76515874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"4","first_page":"345","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9973000288009644,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9973000288009644,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9944000244140625,"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/T10142","display_name":"Formal Methods in Verification","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.8806729912757874},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6875730752944946},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6854637861251831},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6543015241622925},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6458468437194824},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.6226406097412109},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.6008959412574768},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5657671689987183},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.5518848299980164},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5108963847160339},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4897491931915283},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46711716055870056},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.4592767357826233},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.44109901785850525},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.3933914005756378},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.38966673612594604},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.36829873919487},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.33919912576675415},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23911970853805542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14484775066375732},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.11909633874893188},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.10066917538642883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07855913043022156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8806729912757874},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6875730752944946},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6854637861251831},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6543015241622925},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6458468437194824},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.6226406097412109},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.6008959412574768},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5657671689987183},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.5518848299980164},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5108963847160339},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4897491931915283},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46711716055870056},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.4592767357826233},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.44109901785850525},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.3933914005756378},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.38966673612594604},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.36829873919487},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.33919912576675415},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23911970853805542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14484775066375732},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.11909633874893188},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.10066917538642883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07855913043022156},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/088395100117034","is_oa":true,"landing_page_url":"https://doi.org/10.1080/088395100117034","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395100117034?download=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/37babb50-52be-11db-a4bc-000ea68e967b","is_oa":false,"landing_page_url":"https://forskning.ruc.dk/da/publications/37babb50-52be-11db-a4bc-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401457","display_name":"RUCforsk (Roskilde University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107707843","host_organization_name":"Roskilde University","host_organization_lineage":["https://openalex.org/I107707843"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Christiansen, H & Martinenghi, D 2000, 'Symbolic constraints for meta-logic programming', Applied Artificial Intelligence, vol. 14, no. 4, pp. 345-367. https://doi.org/10.1080/088395100117034","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:re.public.polimi.it:11311/516612","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/516612","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1080/088395100117034","is_oa":true,"landing_page_url":"https://doi.org/10.1080/088395100117034","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/088395100117034?download=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2034781759.pdf","grobid_xml":"https://content.openalex.org/works/W2034781759.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4210410383","https://openalex.org/W1589232796","https://openalex.org/W316728381","https://openalex.org/W9461901","https://openalex.org/W316899221","https://openalex.org/W2611103758","https://openalex.org/W1508237628","https://openalex.org/W1490546714","https://openalex.org/W1584569710","https://openalex.org/W1485162787"],"abstract_inverted_index":{"L":[0],"ogic":[1],"programming,":[2,23],"with":[3,27],"its":[4],"declarative":[5],"bias":[6],"as":[7,9,32,100],"well":[8,19],"unication":[10],"and":[11,123],"the":[12,46,49,96,118],"direct":[13],"representation":[14],"of":[15,29,51,75,85,105,111,120,128],"linguistic":[16],"structures,":[17],"is":[18],"qualied":[20],"for":[21],"meta":[22,77],"i.e.,":[24],"programs":[25,31],"working":[26],"representations":[28],"other":[30],"their":[33,124],"data.However,":[34],"constraint":[35,52],"techniques":[36],"seem":[37],"necessary":[38],"in":[39,59,95],"order":[40,60],"to":[41,61,68],"fully":[42],"exploit":[43],"this":[44],"paradigm.In":[45],"DEMOII":[47],"system,":[48],"language":[50],"handling":[53],"rules":[54],"(CHRs)":[55],"has":[56],"been":[57],"used":[58],"provide":[62],"a":[63,76,90],"functionality":[64],"that":[65],"appears":[66],"difficult":[67],"obtain":[69],"without":[70],"such":[71,121],"means.For":[72],"example,":[73],"reversibility":[74],"interpreter,":[78],"which":[79],"can":[80],"be":[81],"obtained":[82],"by":[83,103,126],"means":[84,104,127],"constraints,":[86],"turns":[87],"it":[88],"into":[89],"powerful":[91],"program":[92],"generator":[93],";":[94],"same":[97],"way,":[98],"negation":[99],"failure":[101],"implemented":[102],"constraints":[106,122],"provides":[107],"an":[108],"incremental":[109],"evaluation":[110],"integrity":[112],"constraints.T":[113],"his":[114],"paper":[115],"focuses":[116],"on":[117],"design":[119],"implementation":[125],"CHR.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}