Combining Fixed-Point Definitions and Game Semantics in Logic Programming
Keehang Kwon

TL;DR
This paper extends the operational semantics of logic programming with fixed-point definitions by incorporating game semantics, providing a new logical interpretation especially for the 'read' predicate.
Contribution
It introduces a novel integration of game semantics into fixed-point logic programming, enriching its logical foundation and interpretative capabilities.
Findings
Extended semantics offers a logical status to the 'read' predicate
Game semantics enhances the understanding of fixed-point logic programming
Provides a new perspective on operational semantics in logic programming
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 predicate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Semantic Web and Ontologies
