{"id":"https://openalex.org/W1591242928","doi":null,"title":"Logic programming semantics: techniques and applications","display_name":"Logic programming semantics: techniques and applications","publication_year":1989,"publication_date":"1989-01-03","ids":{"openalex":"https://openalex.org/W1591242928","mag":"1591242928"},"language":"en","primary_location":{"id":"mag:1591242928","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=75902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"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/A5047165422","display_name":"Marianne Baudinet","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marianne Baudinet","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5047165422"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2554,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.88544,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"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/T10126","display_name":"Logic, programming, and type systems","score":0.7103999853134155,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.7103999853134155,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.2816999852657318,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.0032999999821186066,"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/logic-programming-semantics","display_name":"logic programming semantics","score":0.9850000143051147},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.8240000009536743},{"id":"https://openalex.org/keywords/temporal-logic-programming","display_name":"temporal logic programming","score":0.9139999747276306},{"id":"https://openalex.org/keywords/termination-proofs","display_name":"termination proofs","score":0.4779999852180481},{"id":"https://openalex.org/keywords/functional-equations","display_name":"functional equations","score":0.5460000038146973},{"id":"https://openalex.org/keywords/proof-completeness","display_name":"proof completeness","score":0.6129999756813049},{"id":"https://openalex.org/keywords/expressiveness","display_name":"expressiveness","score":0.8619999885559082},{"id":"https://openalex.org/keywords/regular-languages","display_name":"regular languages","score":0.7139999866485596},{"id":"https://openalex.org/keywords/buchi-automata","display_name":"B\u00fcchi automata","score":0.8679999709129333},{"id":"https://openalex.org/keywords/omega-regular-languages","display_name":"omega-regular languages","score":0.9520000219345093},{"id":"https://openalex.org/keywords/stratified-negation","display_name":"stratified negation","score":0.9470000267028809},{"id":"https://openalex.org/keywords/cut","display_name":"cuts","score":0.5270000100135803}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7877137660980225},{"id":"https://openalex.org/C89497691","wikidata":"https://www.wikidata.org/wiki/Q7981058","display_name":"Well-founded semantics","level":5,"score":0.7626538872718811},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.7551889419555664},{"id":"https://openalex.org/C58041814","wikidata":"https://www.wikidata.org/wiki/Q792533","display_name":"Axiomatic semantics","level":5,"score":0.7494050860404968},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.671981155872345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5935330986976624},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.545220673084259},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.5062324404716492},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.491250216960907},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.4757532775402069},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.46476587653160095},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.4364432990550995},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.4296911060810089},{"id":"https://openalex.org/C150607116","wikidata":"https://www.wikidata.org/wiki/Q4677421","display_name":"Action semantics","level":5,"score":0.41654402017593384},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39555686712265015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3064936101436615},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.2698405385017395},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2678435146808624},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1591242928","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=75902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":0,"referenced_works":[],"related_works":["https://openalex.org/W152927470","https://openalex.org/W2020666986","https://openalex.org/W4388216484","https://openalex.org/W1973337882","https://openalex.org/W2059108520","https://openalex.org/W253931719","https://openalex.org/W2050994281","https://openalex.org/W2287769095","https://openalex.org/W2548065651","https://openalex.org/W1487503742"],"abstract_inverted_index":{"It":[0],"is":[1,14,22,78,167,189,276],"generally":[2],"agreed":[3],"that":[4,107,274,282,310,324],"providing":[5],"a":[6,11,37,57,102,114,148,152,165,170,173,176,187,197,213,254,263,277,284],"precise":[7],"formal":[8],"semantics":[9,50,85,103,145,290],"for":[10,31,65,86,117,151],"programming":[12,91,130],"language":[13,131],"helpful":[15],"in":[16,25,44,60,212,216,251,260],"fully":[17],"understanding":[18,61],"the":[19,26,33,47,52,73,111,127,193,204,248,303,315,331],"language.":[20],"This":[21],"especially":[23,221],"true":[24],"case":[27],"of":[28,51,68,75,89,96,104,113,120,133,154,181,186,196,199,247,253,262,279,306,317,333],"logic-programming-like":[29],"languages":[30,92],"which":[32,217],"underlying":[34],"logic":[35,62,69,90,129,156,281],"provides":[36],"well-defined":[38],"but":[39],"insufficient":[40],"semantic":[41],"basis.":[42],"Indeed,":[43],"addition":[45],"to":[46,126,146,158,175,232,272,294],"usual":[48],"model-theoretic":[49],"logic,":[53],"proof-theoretic":[54],"deduction":[55,76],"plays":[56],"crucial":[58],"role":[59],"programs.":[63,122],"Moreover,":[64],"specific":[66],"implementations":[67],"programming,":[70],"e.g.":[71],"PROLOG,":[72],"notion":[74],"strategy":[77],"also":[79,291],"important.\r\nIn":[80],"this":[81,144],"thesis,":[82],"we":[83,100,108,124,242,269,300],"provide":[84,243],"two":[87,244],"types":[88],"and":[93,135,141,157,259,323],"develop":[94,137],"applications":[95],"these":[97,267],"semantics.":[98],"First,":[99],"propose":[101],"PROLOG":[105,121,163,233],"programs":[106,234],"use":[109,143],"as":[110,169,210,239],"basis":[112],"proof":[115,286],"method":[116,230],"termination":[118,222],"properties":[119],"Second,":[123],"turn":[125],"temporal":[128,155,256,280],"TEMPLOG":[132,275,312],"Abadi":[134],"Manna,":[136],"its":[138,325],"declarative":[139,249],"semantics,":[140,164,268],"then":[142,190],"prove":[147,273,309],"completeness":[149],"result":[150],"fragment":[153,278,305],"study":[159,295],"TEMPLOG's":[160,296],"expressiveness.\r\nIn":[161],"our":[162],"program":[166,188,219],"viewed":[168],"function":[171],"mapping":[172],"goal":[174],"finite":[177,318],"or":[178,223,320,336],"infinite":[179],"sequence":[180],"answer":[182],"substitutions.":[183],"The":[184,229,288],"meaning":[185],"given":[191],"by":[192],"least":[194,264],"solution":[195],"system":[198],"functional":[200],"equations":[201,207],"associated":[202],"with":[203,235,327],"program.":[205],"These":[206],"are":[208,270],"taken":[209],"axioms":[211],"first-order":[214],"theory":[215],"various":[218],"properties,":[220,225],"non-termination":[224],"can":[226],"be":[227],"proved.":[228],"extends":[231],"extra-logical":[236],"features":[237],"such":[238],"cut.\r\nFor":[240],"TEMPLOG,":[241],"equivalent":[245],"formulations":[246],"semantics:":[250],"terms":[252,261],"minimal":[255],"Herbrand":[257],"model":[258],"fixpoint.":[265],"Using":[266],"able":[271],"admits":[283],"complete":[285],"system.":[287],"fixpoint":[289],"enables":[292],"us":[293],"expressiveness.":[297],"For":[298],"this,":[299],"focus":[301],"on":[302],"propositional":[304,311],"TEMPLOG.":[307],"We":[308],"has":[313,330],"essentially":[314],"expressiveness":[316,332],"automata":[319,335],"regular":[321],"languages,":[322],"extension":[326],"stratified":[328],"negation":[329],"Buchi":[334],"$\\omega$-regular":[337],"languages.":[338]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}