Combining Fixed-Point Definitions and Game Semantics in Logic Programming

2015/07/26 by Keehang Kwon, Kwon, Keehang
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.1507.07228

openalex publication_date 2015/07/26 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically based on intuitionistic provability. We extend the operational semantics of these languages with game semantics. This extended semantics has several interesting aspects: in particular, it gives a logical status to the read predicate.

Related

• Incorporating Inductions and Game Semantics into Logic Programming
• Is game semantics necessary?
• A uniform approach to logic programming semantics
• Inclusion Logic and Fixed Point Logic
• Inferentialist Game Semantics (Extended Abstract)