Representing action and change by logic programs
From MaRDI portal
Publication:4275262
Recommendations
- scientific article; zbMATH DE number 1453058
- Representing actions in logic programs and default theories a situation calculus approach
- Representing and reasoning about concurrent actions with abductive logic programs
- Representing action: indeterminacy and ramifications
- Representing Incomplete Knowledge in Abductive Logic Programming
Cited in
(95)- Probabilistic reasoning about epistemic action narratives
- Modeling biological networks by action languages via answer set programming
- The refinement extension principle for semantics of dynamic logic programming
- Computational complexity of planning and approximate planning in the presence of incompleteness
- scientific article; zbMATH DE number 1536548 (Why is no real title available?)
- Logic Programming for Multiagent Planning with Negotiation
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- A planning language for embedded systems
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +
- Representation and reasoning about evolutions of the world in the context of reasoning about actions
- LUPS -- A language for updating logic programs
- Stable Models for Temporal Theories
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- John McCarthy's legacy
- Non-Markovian control in the Situation Calculus
- A survey on temporal logics for specifying and verifying real-time systems
- To Vladimir Lifschitz on His 65th Birthday
- A general first-order solution to the ramification problem with cycles
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- Modelling last-act attempted crime in criminal law
- A Representation Theorem for Change through Composition of Activities
- Bounded situation calculus action theories
- Answer set based design of knowledge systems
- t-DeLP: an argumentation-based temporal defeasible logic programming framework
- Partial Functions and Equality in Answer Set Programming
- Formalizing sensing actions -- a transition function based approach
- An epistemic approach to nondeterminism: believing in the simplest course of events
- Reasoning about actions with loops via Hoare logic
- A probabilistic extension of action language \(\mathcal{BC}+\)
- Metatheory of actions: beyond consistency
- On methodology of representing knowledge in dynamic domains
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Formalization of reasoning about default action (preliminary report)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- Introduction: Progress in formal commonsense reasoning
- A unifying action calculus
- On the logic of causal explanation
- Temporal disjunctive logic programming
- Achievements in answer set programming
- Reasoning about actions with Temporal Answer Sets
- Temporal ASP: from logical foundations to practical use with \texttt{telingo}
- Representing action: indeterminacy and ramifications
- Ramification and causality
- Reasoning about sensing actions in domains with multi-valued fluents
- Applications of action languages in cognitive robotics
- Strongly Equivalent Temporal Logic Programs
- Reasoning about action and change
- Simulating production rules using ACTHEX
- A probabilistic interval-based event calculus for activity recognition
- A semantic characterization of a useful fragment of the situation calculus with knowledge
- Formalising the Fisherman's Folly puzzle
- A language for default reasoning about actions
- A new incarnation of action language H
- CASP solutions for planning in hybrid domains
- Knowledge assimilation in domains of actions: a possible causes approach
- On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
- Answer set programming and plan generation
- An action language for multi-agent domains
- Handling inconsistency in knowledge systems
- Probabilistic Reasoning by SAT Solvers
- scientific article; zbMATH DE number 7453110 (Why is no real title available?)
- A Fluent Calculus Semantics for ADL with Plan Constraints
- scientific article; zbMATH DE number 1546503 (Why is no real title available?)
- An abductive proof procedure for reasoning about actions in modal logic programming
- Inductive situation calculus
- Approximate postdictive reasoning with answer set programming
- Revisiting explicit negation in answer set programming
- Event calculus and temporal action logics compared
- Alan: An action language for modelling non-Markovian domains
- Approximation of action theories and its application to conformant planning
- Frame problem in dynamic logic
- Modelling multi-agent epistemic planning in ASP
- On linear logic planning and concurrency
- A general multi-agent epistemic planner based on higher-order belief change
- Considerations on belief revision in an action theory
- scientific article; zbMATH DE number 1696835 (Why is no real title available?)
- Nonmonotonic causal theories
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
- Logic programming and knowledge representation---The A-Prolog perspective
- A Semantical Account of Progression in the Presence of Defaults
- On the progression of belief
- Modeling and reasoning in event calculus using goal-directed constraint answer set programming
- ConGolog, a concurrent programming language based on the situation calculus
- Regression and progression in stochastic domains
- Predicate Completion for non-Horn Clause Sets
- Temporal Equilibrium Logic: A First Approach
- Abductive reasoning through filtering
- Explaining updates by minimal sums
- Logic-based subsumption architecture
- Modular action language \(\mathcal{ALM}\)
- Simulation of action theories and an application to general game-playing robots
- Reasoning about non-immediate triggers in biological networks
- Hypothesizing about signaling networks
- An infinitary encoding of temporal equilibrium logic
This page was built for publication: Representing action and change by logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275262)
