Non-terminating processes in the situation calculus

DOI10.1007/S10472-019-09643-9zbMATH Open1444.68179OpenAlexW2984636524WikidataQ126785455 ScholiaQ126785455MaRDI QIDQ2188782FDOQ2188782

Authors: Giuseppe De Giacomo, Eugenia Ternovska, Ray Reiter 

Publication date: 11 June 2020

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2627

Recommendations

• On the verification of very expressive temporal properties of non-terminating Golog programs
• scientific article; zbMATH DE number 6606377
• Non-Markovian control in the Situation Calculus
• GOLOG: A logic programming language for dynamic domains
• scientific article; zbMATH DE number 3995083

zbMATH Keywords

knowledge representationsituation calculusformal verificationreasoning about actionsinductive definitionsConGolog programsGolog programs

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Cites Work

• ConGolog, a concurrent programming language based on the situation calculus
• GOLOG: A logic programming language for dynamic domains
• Title not available (Why is that?)
• Elementary induction on abstract structures
• A lattice-theoretical fixpoint theorem and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded situation calculus action theories
• Verification of agent-based artifact systems
• Progression and verification of situation calculus agents with bounded beliefs
• Abstract interpretation and application to logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Property persistence in the situation calculus
• Title not available (Why is that?)
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
• Description Logic Knowledge and Action Bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ability and knowing how in the situation calculus
• Title not available (Why is that?)
• Verifying Properties of Infinite Sequences of Description Logic Actions
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• On the verification of very expressive temporal properties of non-terminating Golog programs
• Title not available (Why is that?)
• Kleene star, subexponentials without contraction, and infinite computations

Uses Software

• ConGolog
• GOLOG

This page was built for publication: Non-terminating processes in the situation calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188782)