5 found
Order:
  1. Introspective Forgetting.Hans van Ditmarsch, Andreas Herzig, Jérôme Lang & Pierre Marquis - 2009 - Synthese 169 (2):405-423.
    We model the forgetting of propositional variables in a modal logical context where agents become ignorant and are aware of each others’ or their own resulting ignorance. The resulting logic is sound and complete. It can be compared to variable-forgetting as abstraction from information, wherein agents become unaware of certain variables: by employing elementary results for bisimulation, it follows that beliefs not involving the forgotten atom(s) remain true.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  10
    Introspective Forgetting.Hans Ditmarsch, Andreas Herzig, Jérôme Lang & Pierre Marquis - 2009 - Synthese 169 (2):405-423.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  26
    Handling Controversial Arguments.Sylvie Coste-Marquis, Caroline Devred & Pierre Marquis - 2009 - Journal of Applied Non-Classical Logics 19 (3):311-369.
    We present two prudent semantics within Dung's theory of argumentation. They are based on two new notions of extension, referred to as p-extension and c-extension. Two arguments cannot belong to the same p-extension whenever one of them attacks indirectly the other one. Two arguments cannot belong to the same c-extension whenever one of them indirectly attacks a third argument while the other one indirectly defends the third. We argue that our semantics lead to a better handling of controversial arguments than (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  21
    Removing Inconsistencies in Assumption-Based Theories Through Knowledge-Gathering Actions.Jérôme Lang & Pierre Marquis - 2001 - Studia Logica 67 (2):179-214.
    In this paper, the problem of purifying an assumption-based theory KB, i.e., identifying the right extension of KB using knowledge-gathering actions (tests), is addressed. Assumptions are just normal defaults without prerequisite. Each assumption represents all the information conveyed by an agent, and every agent is associated with a (possibly empty) set of tests. Through the execution of tests, the epistemic status of assumptions can change from "plausible" to "certainly true", "certainly false" or "irrelevant", and the KB must be revised so (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  5.  10
    Computational Aspects of Quasi-Classical Entailment.Pierre Marquis & Nadège Porquet - 2001 - Journal of Applied Non-Classical Logics 11 (3-4):294-312.
    Quasi-classical logic is a propositional logic for reasoning under inconsistency pointed out recently in the literature [3] [21]. Compared with several other paraconsistent logics, it has the nice feature that no special attention needs to be paid to a special form of premises. However, only few is known about its computational behaviour up to now. In this paper, we fill this gap by pointing out a linear time translation that maps every instance of the quasi-classical entailment problem for CNF formulas (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark