Filters








297 Hits in 4.2 sec

Towards State Update Axioms: Reifying Successor State Axioms [chapter]

Michael Thielscher
1998 Lecture Notes in Computer Science  
The resulting concept of state update axioms constitutes a novel version of what is known as the Fluent Calculus.  ...  Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions-but only as far as its representational aspect is concerned.  ...  In the following section we illustrate by means of examples how successor state axioms can thus be reified to what we call state update axioms.  ... 
doi:10.1007/3-540-49545-2_17 fatcat:qaojhturoza6vf7ma45bkzon6i

Knowledge and observations in the situation calculus

Ryan F. Kelly, Adrian R. Pearce
2007 Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems - AAMAS '07  
Our approach generalizes existing work by reifying the observations made by each agent as the world evolves, allowing for agents that are partially or completely unaware of some of the actions that have  ...  state axioms.  ...  Following this intuition, the successor state axiom below captures the desired dynamics If c was totally unobservable, the agent's state of knowledge does not change.  ... 
doi:10.1145/1329125.1329278 dblp:conf/atal/KellyP07 fatcat:fmcib7clebgq3mftel6yaliywa

FLUX: A Logic Programming Method for Reasoning Agents [article]

Michael Thielscher
2004 arXiv   pre-print
Fortunately, obtaining a weaker update specification-just like an incomplete inference engine-is not an obstacle towards sound agent programs.  ...  To solve the frame problem, FLUX uses state update axioms, which specify the effects of an action on an entire state.  ... 
arXiv:cs/0408044v1 fatcat:d6epapx7ired5arhd3svqrcpoe

FLUX: A logic programming method for reasoning agents

MICHAEL THIELSCHER
2005 Theory and Practice of Logic Programming  
These include • action precondition axioms, • update axioms, • domain constraints, and • initial knowledge state.  ...  Fortunately, obtaining a weaker update specification-just like an incomplete inference engine-is not an obstacle towards sound agent programs.  ...  With the progression principle, FLUX programs scale up well to the control of agents over extended periods. 7 Moreover, progression through state update axioms in FLUX provides an efficient solution to  ... 
doi:10.1017/s1471068405002358 fatcat:vprihzm4nbbeboneg32rzzcnqy

Page 5753 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
state update axioms: reifying successor state axioms (248-263); Jeremy E.  ...  and Masami Hagiya, Higher order generalization (368-381); Erik Sandewall, The logical character- ization of goal-directed behavior in the presence of exogenous events (summary) (382-384); Paul Tarau, Towards  ... 

Partially Observable Concurrent Kleene Algebra

Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, Alexandra Silva, Laura Kovács, Igor Konnov
2020 International Conference on Concurrency Theory  
First, we define the result of a state after updating it for one value. Let a ∈ Act and α ∈ State. We say that α[a] exists if a = v ← n for some n ∈ Val or a = v ← v and v ∈ dom(α).  ...  (A3) Action-nodes have unique state-nodes as neighbours (their predecessor and successor).  ...  B Proofs towards completeness The following three results are all needed in the proofs that follow, and come from [12] .  ... 
doi:10.4230/lipics.concur.2020.20 dblp:conf/concur/WagemakerBDKR020 fatcat:b3yl27z3xjdiparebr46czphs4

Asynchronous knowledge with hidden actions in the situation calculus

Ryan F. Kelly, Adrian R. Pearce
2015 Artificial Intelligence  
Equation (3) takes the form of a standard successor state axiom for the K fluent.  ...  true initially, is implied for all situations by the successor state axioms above.  ... 
doi:10.1016/j.artint.2014.12.005 fatcat:b3obnhthzrhz3dgislzdesfxtq

The Qualification Problem: A solution to the problem of anomalous models

Michael Thielscher
2001 Artificial Intelligence  
State update axioms The schema Poss(A( x), s) ⊃ Γ [State(Do(A( x), s)), State(s)] is the universal form of state update axioms.  ...  the antecedents of state update axioms.  ... 
doi:10.1016/s0004-3702(01)00131-x fatcat:idqh2rr2vbbotjrnbfs74jmdeu

A Logical Theory of Localization

Vaishak Belle, Hector J. Levesque
2015 Studia Logica: An International Journal for Symbolic Logic  
Second, a successor state axiom of the following form is provided for the This successor state axiom states that, given an appropriate action likelihood axiom, the weight of situations s relative to do  ...  Perhaps most significantly, we demonstrate how the framework subsumes probabilistic formalisms by using the full range of situation calculus successor state axioms and sensing axioms.  ... 
doi:10.1007/s11225-015-9625-0 fatcat:xjhr5dmjmnfqtkgfrb4sflgppi

Reasoning about Discrete and Continuous Noisy Sensors and Effectors in Dynamical Systems [article]

Vaishak Belle, Hector J. Levesque
2018 arXiv   pre-print
) moves the robot towards the wall by z units (that is, it is deterministic), for which we use the successor state axiom (7) .  ...  The successor state axiom for the fluent h is (14) . For p, it is the usual one, viz. (P2).  ... 
arXiv:1809.05314v1 fatcat:qtg7o2k7snb6jo2rgpe4eumd7a

Partially Observable Concurrent Kleene Algebra [article]

Jana Wagemaker and Paul Brunet and Simon Docherty and Tobias Kappé and Jurriaan Rot and Alexandra Silva
2020 arXiv   pre-print
First, we define the result of a state after updating it for one value. Let a ∈ Act and α ∈ State. We say that α[a] exists if a = v ← n for some n ∈ Val or a = v ← v and v ∈ dom(α).  ...  It follows that p ≡ {α ∈ State | α p} ≡ {α ∈ State | α q} ≡ q, as required. B Proofs towards completeness The following three results are all needed in the proofs that follow, and come from [12] .  ...  If u 1 is the successor or predecessor of u 0 , then h(u 1 ) is the successor, resp. Proof. If h(u 1 ) is the successor of h(u 0 ) in V , we know that h(u 0 ) ≤ v h(u 1 ).  ... 
arXiv:2007.07593v2 fatcat:45mi4yoyjrdv3nsc2gsbcjur4u

Robot Controllers for Highly Dynamic Environments with Real-time Constraints

Alexander Ferrein
2010 Künstliche Intelligenz  
via the successor state axioms.  ...  While in the situation calculus a successor state axiom is devised for each fluent, a state update axiom is devised for each action in the fluent calculus.  ... 
doi:10.1007/s13218-010-0041-3 fatcat:ltrvy7pynjbs7joc5exp2khgii

On Plans With Loops and Noise [article]

Vaishak Belle
2018 arXiv   pre-print
Likelihoods and alt-axioms determine the probability of successors, enabled by the following successor state axiom: p(s ′ , do(a, s)) = u ≡ ∃a ′ , z, s ′′ [alt(a, a ′ , z) ∧ s ′ = do(a ′ , s ′′ ) ∧ Poss  ...  That is, starting from a control state (from the plan structure) and the agent's beliefs, we will need to define how a new control state is reached with an updated set of beliefs.  ... 
arXiv:1809.05309v1 fatcat:ctk726yp5nhnjpo7db3npxc7lq

On the projection problem in active knowledge bases with incomplete information

Vaishak Belle
2014 AI Matters  
Moreover, when effectors are unreliable, we allow the system to maintain probabilistic beliefs and then show how projection can be addressed by means of updating these beliefs.  ...  identified as a fundamental reasoning concern in dynamical domains, where we are to determine whether or not some conditions will hold after a sequence of actions has been performed starting in some initial state  ...  This is then coupled with states to obtain a dual representation of Reiter-style successor state axioms called as state update axioms.  ... 
doi:10.1145/2685328.2685332 fatcat:frbyhcbfcbaz7bjmmauw4vhcky

Charaterising Object-Based Frameworks in First-Order Predicate Logic [chapter]

Shui-Ming Ho, Kung-Kiu Lau
2006 Series on Component-Based Software Development  
OCL 2.0 goes some way toward expressing these kinds of rules.  ...  in the subject sending a notification to its observers, in turn, causing them to update themselves.  ... 
doi:10.1142/9789812772831_0008 fatcat:v6cfehu4tza2pnpgx65ayyw3mm
« Previous Showing results 1 — 15 out of 297 results