A framework for belief-based programs and their verification

DOI10.1613/JAIR.1.15796MaRDI QIDQ7014297zbMATH OpenFDO

Authors Daxin Liu, Gerhard Lakemeyer

Publication date 11 March 2025

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/JAIR.1.15796

zbMATH Keywords

reasoning about actions and changereasoning about belief and knowledgevalidationverification

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites work

• A formalization of programs in first-order logic with a discrete linear order
• A logic for reasoning about time and reliability
• A Logic of Probability with Decidable Model Checking
• A semantic characterization of a useful fragment of the situation calculus with knowledge
• ConGolog, a concurrent programming language based on the situation calculus
• Decidable problems for probabilistic automata on infinite words
• Decidable verification of decision-theoretic Golog
• Deciding the value 1 problem for probabilistic leaktight automata
• GOLOG: A logic programming language for dynamic domains
• How to progress a database
• scientific article; zbMATH DE number 1157649 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• scientific article; zbMATH DE number 1390352 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Introduction to probability
• Knowledge, action, and the frame problem
• Nicht konstruktiv beweisbare Sätze der Analysis
• Non-terminating processes in the situation calculus
• On the progression of belief
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Optimal cost almost-sure reachability in POMDPs
• Practical solution techniques for first-order MDPs
• Probabilistic automata on finite words: decidable and undecidable problems
• Programming Multi-Agent Systems in AgentSpeak usingJason
• Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
• Reasoning about noisy sensors and effectors in the situation calculus
• Regression and progression in stochastic domains
• Stochastic games for verification of probabilistic timed automata
• The logic of knowledge bases
• Verification and control of partially observable probabilistic systems
• Verification of Indefinite-Horizon POMDPs
• Verifying CTL\(^\ast\) properties of \textsc{Golog} programs over local-effect actions

This page was built for publication: A framework for belief-based programs and their verification

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