Switch to: Citations

Add references

You must login to add references.
  1. Knowledge updates: Semantics and complexity issues.Chitta Baral & Yan Zhang - 2005 - Artificial Intelligence 164 (1-2):209-243.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Solving logic program conflict through strong and weak forgettings.Yan Zhang & Norman Y. Foo - 2006 - Artificial Intelligence 170 (8-9):739-778.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The logic of pit.Hans P. Van Ditmarsch - 2006 - Synthese 149 (2):343-374.
    Pit is a multi-player card game that simulates the commodities trading market, and where actions consist of bidding and of swapping cards. We present a formal description of the knowledge and change of knowledge in that game. The description is in a standard language for dynamic epistemics expanded with assignment. Assignment is necessary to describe that cards change hands. The formal description is a prerequisite to model Pit in game theory. The main contribution of this paper should be seen as (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Complete axiomatizations for reasoning about knowledge and branching time.Ron van der Meyden & Ka-shu Wong - 2003 - Studia Logica 75 (1):93 - 123.
    Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Complete Axiomatizations for Reasoning about Knowledge and Branching Time.Ron van der Meyden & Ka-shu Wong - 2003 - Studia Logica 75 (1):93-123.
    Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Agent-oriented epistemic reasoning: Subjective conditions of knowledge and belief.Daniel G. Schwartz - 2003 - Artificial Intelligence 148 (1-2):177-195.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On strongest necessary and weakest sufficient conditions☆☆An earlier version of this paper was the co-winner of the Best Paper Award at KR2000.Fangzhen Lin - 2001 - Artificial Intelligence 128 (1-2):143-159.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Propositional belief base update and minimal change.Andreas Herzig & Omar Rifi - 1999 - Artificial Intelligence 115 (1):107-138.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Undefinability of propositional quantifiers in the modal system S.Silvio Ghilardi & Marek Zawadowski - 1995 - Studia Logica 55 (2):259 - 271.
    We show that (contrary to the parallel case of intuitionistic logic, see [7], [4]) there does not exist a translation fromS42 (the propositional modal systemS4 enriched with propositional quantifiers) intoS4 that preserves provability and reduces to identity for Boolean connectives and.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Semantic forgetting in answer set programming.Thomas Eiter & Kewen Wang - 2008 - Artificial Intelligence 172 (14):1644-1672.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Logic of Pit.Hans Ditmarsch - 2006 - Synthese 149 (2):343-374.
    Pit is a multi-player card game that simulates the commodities trading market, and where actions consist of bidding and of swapping cards. We present a formal description of the knowledge and change of knowledge in that game. The description is in a standard language for dynamic epistemics expanded with assignment. Assignment is necessary to describe that cards change hands. The formal description is a prerequisite to model Pit in game theory. The main contribution of this paper should be seen as (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation