Cover Image

Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hofmann, Till, Schupp, Stefan, Lakemeyer, Gerhard
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Abstracting Situation Calculus Action Theories
by: Banihashemi, Bita, et al.
Published: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

LTLf Synthesis on First-Order Agent Programs in Nondeterministic Environments
by: Hofmann, Till, et al.
Published: (2024)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

Intuitionistic $j$-Do-Calculus in Topos Causal Models
by: Mahadevan, Sridhar
Published: (2025)

Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete
by: Ghosh, Avijeet, et al.
Published: (2025)

A Translation of Probabilistic Event Calculus into Markov Decision Processes
by: Xu, Lyris, et al.
Published: (2025)

Reasoning About Action and Change
by: de Saint-Cyr, Florence Dupin, et al.
Published: (2024)

Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description)
by: Lellmann, Björn, et al.
Published: (2024)

Decidable By Construction: Design-Time Verification for Trustworthy AI
by: Haynes, Houston
Published: (2026)

The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Abductive Reasoning in a Paraconsistent Framework
by: Bienvenu, Meghyn, et al.
Published: (2024)

A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
by: Nunn, Pierre, et al.
Published: (2024)

Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives
by: Belly, Marius, et al.
Published: (2024)

A fuzzy loss for ontology classification
by: Flügel, Simon, et al.
Published: (2024)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
by: Artale, Alessandro, et al.
Published: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
by: Ratschan, Stefan
Published: (2023)

Halting Recurrent GNNs and the Graded $μ$-Calculus
by: Bollen, Jeroen, et al.
Published: (2025)

Formal Reasoning About Confidence and Automated Verification of Neural Networks
by: Afzal, Mohammad, et al.
Published: (2025)

On Probabilistic and Causal Reasoning with Summation Operators
by: Ibeling, Duligur, et al.
Published: (2024)

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
by: Chernobrovkin, Artem, et al.
Published: (2025)

The Universal PDDL Domain
by: Haslum, Patrik, et al.
Published: (2024)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Finite Groundings for ASP with Functions: A Journey through Consistency
by: Gerlach, Lukas, et al.
Published: (2024)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
by: Xiao, Shengping, et al.
Published: (2024)

Specifying an Obligation Taxonomy in the Non-Markovian Situation Calculus
by: Kalala, Kalonji, et al.
Published: (2025)

Defeasible Reasoning on Concepts
by: Ding, Yiwen, et al.
Published: (2024)

Reasoning in Neurosymbolic AI
by: Tran, Son, et al.
Published: (2025)

Enhancing Analogical Reasoning in the Abstraction and Reasoning Corpus via Model-Based RL
by: Lee, Jihwan, et al.
Published: (2024)

ReasonOps: A Unified Operational Paradigm for Trustworthy Verified LLM Reasoning
by: Rashid, Adnan
Published: (2026)

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
by: Kim, Curie, et al.
Published: (2026)

Faster Lifting for Ordered Domains with Predecessor Relations
by: Zou, Kuncheng, et al.
Published: (2025)

Integrating Belief Domains into Probabilistic Logic Programs
by: Azzolini, Damiano, et al.
Published: (2025)

Approximate SMT Counting Beyond Discrete Domains
by: Shaw, Arijit, et al.
Published: (2025)

About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)

On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
by: Kobayashi, Naoki
Published: (2024)

Robustness of Constraint Automata for Description Logics with Concrete Domains
by: Demri, Stéphane, et al.
Published: (2026)

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
by: Szeider, Stefan
Published: (2026)

Canonical Decision Diagrams Modulo Theories
by: Michelutti, Massimo, et al.
Published: (2024)

On the Boolean Network Theory of Datalog$^\neg$
by: Trinh, Van-Giang, et al.
Published: (2025)