{"id":"https://openalex.org/W2152946860","doi":"https://doi.org/10.1007/978-3-7091-6510-2_11","title":"Refinement and Demonic Semantics","display_name":"Refinement and Demonic Semantics","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2152946860","doi":"https://doi.org/10.1007/978-3-7091-6510-2_11","mag":"2152946860"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-7091-6510-2_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-7091-6510-2_11","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Relational Methods in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5108209111","display_name":"Jules Desharnais","orcid":null},"institutions":[{"id":"https://openalex.org/I157614274","display_name":"University of Cape Town","ror":"https://ror.org/03p74gp79","country_code":"ZA","type":"education","lineage":["https://openalex.org/I157614274"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Jules Desharnais","raw_affiliation_strings":["Department of Mathematics and Applied Mathematics, University of Cape Town, Cape Town, South Africa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applied Mathematics, University of Cape Town, Cape Town, South Africa","institution_ids":["https://openalex.org/I157614274"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115598651","display_name":"Ali Mili","orcid":"https://orcid.org/0000-0002-6578-5510"},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ali Mili","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen, Neubiberg, Federal Republic of Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen, Neubiberg, Federal Republic of Germany","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103876019","display_name":"Thanh Tung Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thanh Tung Nguyen","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen, Neubiberg, Federal Republic of Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr M\u00fcnchen, Neubiberg, Federal Republic of Germany","institution_ids":["https://openalex.org/I40527276"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.29,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.8128655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"166","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9951000213623047,"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.9951000213623047,"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.9837999939918518,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.98089998960495,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8654159307479858},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7314873933792114},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.6879844665527344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6837051510810852},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6029651165008545},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5927501916885376},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.4925139844417572},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3433772027492523},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.08327311277389526},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.05888712406158447}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8654159307479858},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7314873933792114},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.6879844665527344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6837051510810852},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6029651165008545},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5927501916885376},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.4925139844417572},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3433772027492523},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.08327311277389526},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.05888712406158447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-7091-6510-2_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-7091-6510-2_11","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Relational Methods in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W4234874385","https://openalex.org/W2372895815","https://openalex.org/W2349474539","https://openalex.org/W2366583813","https://openalex.org/W2385737134","https://openalex.org/W2323648130","https://openalex.org/W2788308474"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
