{"id":"https://openalex.org/W1528077596","doi":null,"title":"ProLogICA : a practical system for Abductive Logic Programming","display_name":"ProLogICA : a practical system for Abductive Logic Programming","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1528077596","mag":"1528077596"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.1266","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.1266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/Publications/Papers/2000635.pdf","raw_type":"text"},"volume":null,"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/A5051924120","display_name":"Oliver Ray","orcid":"https://orcid.org/0000-0002-0221-1501","observed_orcids":["https://orcid.org/0000-0002-0221-1501"]},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Oliver Ray","raw_affiliation_strings":["Imperial College London,#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-0221-1501","affiliations":[{"raw_affiliation_string":"Imperial College London,#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019675760","display_name":"Antonis C. Kakas","orcid":"https://orcid.org/0000-0001-6773-3944","observed_orcids":["https://orcid.org/0000-0001-6773-3944"]},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Antonis Kakas","raw_affiliation_strings":["University of Cyprus"],"raw_orcid":"https://orcid.org/0000-0001-6773-3944","affiliations":[{"raw_affiliation_string":"University of Cyprus","institution_ids":["https://openalex.org/I34771391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081145311","display_name":"J\u00fcrgen Dix","orcid":"https://orcid.org/0000-0002-8528-1440","observed_orcids":["https://orcid.org/0000-0002-8528-1440"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Dix","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109043125","display_name":"Aaron Hunter","orcid":"https://orcid.org/0000-0002-5460-1587","observed_orcids":["https://orcid.org/0000-0002-5460-1587"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aaron Hunter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9498,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94693967,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9926999807357788,"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, Reasoning, and Knowledge","score":0.9926999807357788,"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.0017999999690800905,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0012000000569969416,"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/abductive-logic-programming","display_name":"abductive logic programming","score":0.8830000162124634},{"id":"https://openalex.org/keywords/negation-as-failure","display_name":"negation as failure","score":0.9950000047683716},{"id":"https://openalex.org/keywords/integrity-constraints","display_name":"integrity constraints","score":0.9990000128746033},{"id":"https://openalex.org/keywords/computational-biology","display_name":"computational biology","score":0.6069999933242798},{"id":"https://openalex.org/keywords/temporal-reasoning","display_name":"temporal reasoning","score":0.9980000257492065},{"id":"https://openalex.org/keywords/machine-learning","display_name":"machine learning","score":0.8669999837875366}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7008910179138184},{"id":"https://openalex.org/C166088908","wikidata":"https://www.wikidata.org/wiki/Q308495","display_name":"Abductive reasoning","level":2,"score":0.6201939582824707},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5444681644439697},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5139431357383728},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5097507834434509},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4735264778137207},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.468691349029541},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.44328245520591736},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44029465317726135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3944353461265564},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3865357041358948},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.36845409870147705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.151558518409729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1272522509098053},{"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},{"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:CiteSeerX.psu:10.1.1.62.1266","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.1266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bris.ac.uk/Publications/Papers/2000635.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/db87dd6b-c3fe-4a80-8bc4-32eea52c3b9f","doi":null,"is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/db87dd6b-c3fe-4a80-8bc4-32eea52c3b9f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ray, O, Kakas, A, Dix, J & Hunter, A 2006, ProLogICA: a practical system for Abductive Logic Programming. in 11th International Workshop on Non-monotonic Reasoning. < http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=2000635 >","raw_type":"contributionToPeriodical"},{"id":"mag:1528077596","doi":null,"is_oa":false,"landing_page_url":"http://www.cs.bris.ac.uk/Publications/Papers/2000635.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420625","display_name":"Non-Monotonic Reasoning","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Non-Monotonic Reasoning","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W81377374","https://openalex.org/W108833919","https://openalex.org/W163500809","https://openalex.org/W176609766","https://openalex.org/W206670740","https://openalex.org/W1487569371","https://openalex.org/W1487715631","https://openalex.org/W1488364561","https://openalex.org/W1509180139","https://openalex.org/W1548234627","https://openalex.org/W1560971821","https://openalex.org/W1589487547","https://openalex.org/W1601026879","https://openalex.org/W1754623046","https://openalex.org/W1780039904","https://openalex.org/W2009737909","https://openalex.org/W2010087056","https://openalex.org/W2011124182","https://openalex.org/W2022472812","https://openalex.org/W2078139775","https://openalex.org/W2084846114"],"related_works":["https://openalex.org/W2527076544","https://openalex.org/W7098407434","https://openalex.org/W7099857134","https://openalex.org/W132658143","https://openalex.org/W2524588181","https://openalex.org/W7033705810","https://openalex.org/W2979507757","https://openalex.org/W7100205113","https://openalex.org/W7096821438","https://openalex.org/W2555895195"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,65,88],"new":[4],"system":[5,23],"called":[6],"ProLogICA":[7,99],"for":[8],"Abductive":[9],"Logic":[10],"Programming":[11],"(ALP)":[12],"with":[13],"Negation":[14],"as":[15],"Failure":[16],"(NAF)":[17],"and":[18,33,44,94],"Integrity":[19],"Constraints":[20],"(ICs).":[21],"The":[22],"builds":[24],"upon":[25],"existing":[26],"ALP":[27,50],"techniques":[28],"but":[29],"includes":[30],"several":[31],"optimisations":[32],"extensions":[34],"necessitated":[35],"by":[36],"recent":[37],"applications":[38],"in":[39],"computational":[40],"biology,":[41],"temporal":[42],"reasoning":[43],"machine":[45],"learning.":[46],"Unlike":[47],"some":[48],"other":[49],"systems":[51],"that":[52],"support":[53],"non-ground":[54],"abduction":[55],"through":[56],"the":[57,74,96],"integrated":[58],"use":[59],"of":[60,76,91,98],"constraint":[61],"solving,":[62],"we":[63],"adopt":[64],"more":[66],"lightweight":[67],"approach":[68,84],"which":[69],"avoids":[70],"this":[71],"complexity":[72],"at":[73],"expense":[75],"only":[77],"computing":[78],"ground":[79],"hypotheses.":[80],"We":[81],"argue":[82],"our":[83],"is":[85],"suited":[86],"to":[87],"wide":[89],"class":[90],"real-world":[92],"problems":[93],"demonstrate":[95],"effectiveness":[97],"on":[100],"three":[101],"non-trivial":[102],"applications.":[103]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}