Parameterized Logical Theories
Fangzhen Lin
Abstract
A theory in first-order logic is a set of sentences. A parameterized theory is a first-order theory with some of its predicates and functions identified as parameters, together with some import statements that call other parameterized theories. A KB is then a collection of these interconnected parameterised theories, similar to how a computer program is constructed as a set of functions in a modern programming language. In this paper, we provide a translational semantics for these parameterized theories in first-order logic using the situation calculus. We also discuss their potential uses in areas such as multi-context reasoning and logical formalization of computer programs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 819a1854-0a09-41d3-a26a-59645617b184Related papers
- On Action Theories with Iterable First-Order ProgressionDaxin Liu, Jens ClaßenAAAI 2025 · 1 citation
- Abstraction of Situation Calculus Concurrent Game StructuresYves Lespérance, Giuseppe De Giacomo, Maryam Rostamigiv, Shakil M. KhanAAAI 2024 · 7 citations
- From Actions to Programs as Abstract Actual CausesBita Banihashemi, Shakil M. Khan, Mikhail SoutchanskiAAAI 2022 · 1 citation
- Bialgebraic Reasoning on Higher-order Program EquivalenceSergey Goncharov, Stefan Milius, Stelios Tsampas, Henning UrbatLICS 2024 · 4 citations
- Internal Parametricity, without an IntervalThorsten Altenkirch, Yorgo Chamoun, Ambrus Kaposi, Michael ShulmanPOPL 2024 · 4 citations
