Image de couverture de livre

Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hofmann, Till, Schupp, Stefan, Lakemeyer, Gerhard
Format:	Preprint
Publié:	2024
Sujets:	Artificial Intelligence Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Abstracting Situation Calculus Action Theories
par: Banihashemi, Bita, et autres
Publié: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
par: Feller, Thomas, et autres
Publié: (2023)

LTLf Synthesis on First-Order Agent Programs in Nondeterministic Environments
par: Hofmann, Till, et autres
Publié: (2024)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
par: Lutz, Carsten, et autres
Publié: (2024)

Intuitionistic $j$-Do-Calculus in Topos Causal Models
par: Mahadevan, Sridhar
Publié: (2025)

Reasoning About Knowledge on Regular Expressions is 2EXPTIME-complete
par: Ghosh, Avijeet, et autres
Publié: (2025)

A Translation of Probabilistic Event Calculus into Markov Decision Processes
par: Xu, Lyris, et autres
Publié: (2025)

Reasoning About Action and Change
par: de Saint-Cyr, Florence Dupin, et autres
Publié: (2024)

Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description)
par: Lellmann, Björn, et autres
Publié: (2024)

Decidable By Construction: Design-Time Verification for Trustworthy AI
par: Haynes, Houston
Publié: (2026)

The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules
par: Ostropolski-Nalewaja, Piotr, et autres
Publié: (2024)

Abductive Reasoning in a Paraconsistent Framework
par: Bienvenu, Meghyn, et autres
Publié: (2024)

A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
par: Nunn, Pierre, et autres
Publié: (2024)

Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives
par: Belly, Marius, et autres
Publié: (2024)

A fuzzy loss for ontology classification
par: Flügel, Simon, et autres
Publié: (2024)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
par: Artale, Alessandro, et autres
Publié: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
par: Ratschan, Stefan
Publié: (2023)

Halting Recurrent GNNs and the Graded $μ$-Calculus
par: Bollen, Jeroen, et autres
Publié: (2025)

Formal Reasoning About Confidence and Automated Verification of Neural Networks
par: Afzal, Mohammad, et autres
Publié: (2025)

On Probabilistic and Causal Reasoning with Summation Operators
par: Ibeling, Duligur, et autres
Publié: (2024)

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
par: Chernobrovkin, Artem, et autres
Publié: (2025)

The Universal PDDL Domain
par: Haslum, Patrik, et autres
Publié: (2024)

Deciding Equations in the Time Warp Algebra
par: van Gool, Sam, et autres
Publié: (2023)

Finite Groundings for ASP with Functions: A Journey through Consistency
par: Gerlach, Lukas, et autres
Publié: (2024)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
par: Xiao, Shengping, et autres
Publié: (2024)

Specifying an Obligation Taxonomy in the Non-Markovian Situation Calculus
par: Kalala, Kalonji, et autres
Publié: (2025)

Defeasible Reasoning on Concepts
par: Ding, Yiwen, et autres
Publié: (2024)

Reasoning in Neurosymbolic AI
par: Tran, Son, et autres
Publié: (2025)

Enhancing Analogical Reasoning in the Abstraction and Reasoning Corpus via Model-Based RL
par: Lee, Jihwan, et autres
Publié: (2024)

ReasonOps: A Unified Operational Paradigm for Trustworthy Verified LLM Reasoning
par: Rashid, Adnan
Publié: (2026)

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
par: Kim, Curie, et autres
Publié: (2026)

Faster Lifting for Ordered Domains with Predecessor Relations
par: Zou, Kuncheng, et autres
Publié: (2025)

Integrating Belief Domains into Probabilistic Logic Programs
par: Azzolini, Damiano, et autres
Publié: (2025)

Approximate SMT Counting Beyond Discrete Domains
par: Shaw, Arijit, et autres
Publié: (2025)

About Time: Model-free Reinforcement Learning with Timed Reward Machines
par: Roy, Rajarshi, et autres
Publié: (2025)

On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
par: Kobayashi, Naoki
Publié: (2024)

Robustness of Constraint Automata for Description Logics with Concrete Domains
par: Demri, Stéphane, et autres
Publié: (2026)

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
par: Szeider, Stefan
Publié: (2026)

Canonical Decision Diagrams Modulo Theories
par: Michelutti, Massimo, et autres
Publié: (2024)

On the Boolean Network Theory of Datalog$^\neg$
par: Trinh, Van-Giang, et autres
Publié: (2025)