Compositional Belief Update

Arc suppressing gas in a high voltage circuit breaker system is collected, filtered and compressed. The compressed gas is passed through a series of oil and desiccant filters and returned to a high pressure vessel for storage. The oil and desiccant filtering system is combined in a single, separable casing including baffles and a check valve.

[1]  Francesco M. Donini,et al.  The size of a revised knowledge base , 1995, PODS '95.

[2]  Mary-Anne Williams,et al.  Towards a Practical Approach to Belief Revision: Reason-Based Change , 1996, KR.

[3]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[4]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[5]  Fangzhen Lin,et al.  Forgetting and Knowledge Update , 2006, Australian Conference on Artificial Intelligence.

[6]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[7]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[8]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[9]  R. Reiter,et al.  Forget It ! , 1994 .

[10]  Alberto O. Mendelzon,et al.  Merging Databases Under Constraints , 1998, Int. J. Cooperative Inf. Syst..

[11]  Sébastien Konieczny,et al.  On the Difference between Merging Knowledge Bases and Combining them , 2000, KR.

[12]  Norman Y. Foo,et al.  Distance Semantics for Relevance-Sensitive Belief Revision , 2004, KR.

[13]  Peter Z. Revesz.  On the semantics of theory change: arbitration between old and new information , 1993, PODS '93.

[14]  Maurice Pagnucco,et al.  Gricean Belief Change , 2005, Stud Logica.

[15]  Fangzhen Lin,et al.  On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..

[16]  Torsten Schaub,et al.  A consistency-based approach for belief change , 2003, Artif. Intell..

[17]  Andreas Weber,et al.  Updating Propositional Formulas , 1986, Expert Database Conf..

[18]  Sébastien Konieczny,et al.  Merging Information Under Constraints: A Logical Framework , 2002, J. Log. Comput..

[19]  Maurice Pagnucco,et al.  Severe Withdrawal (and Recovery) , 1999, J. Philos. Log..

[20]  Ali R. Hurson,et al.  A taxonomy and current issues in multidatabase systems , 1992, Computer.

[21]  R. Parikh.  Beliefs, belief revision, and splitting languages , 1999 .

[22]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[23]  Alexander Borgida,et al.  Language features for flexible handling of exceptions in information systems , 1985, TODS.

[24]  Kenneth D. Forbus.  Introducing Actions into Qualitative Simulation , 1989, IJCAI.

[25]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[26]  Patrick Doherty,et al.  The PMA and relativizing change for action update , 1998 .

[27]  Thomas Andreas Meyer.  On the semantics of combination operations , 2001, J. Appl. Non Class. Logics.

[28]  George Boole,et al.  An Investigation of the Laws of Thought: Frontmatter , 2009 .

[29]  Sébastien Konieczny,et al.  The Strategy-Proofness Landscape of Merging , 2011, J. Artif. Intell. Res..

[30]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[31]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[32]  Marco Schaerf,et al.  Arbitration (or How to Merge Knowledge Bases) , 1998, IEEE Trans. Knowl. Data Eng..

[33]  Thomas Andreas Meyer,et al.  Merging Epistemic States , 2000, PRICAI.

[34]  Khalid Ali,et al.  Proof , 2006, BMJ : British Medical Journal.

[35]  Neil Tennant.  On having bad contractions, or: no room for recovery , 1997 .

[36]  Sébastien Konieczny,et al.  On the Logic of Merging , 1998, KR.

[37]  Sébastien Konieczny,et al.  Quota and Gmin Merging Operators , 2005, IJCAI.

[38]  Ken Satoh.  Nonmonotonic Reasoning by Minimal Belief Revision , 1988, FGCS.

[39]  Joachim Hertzberg,et al.  How to do Things with Worlds: On Formalizing Actions and Plans , 1993, J. Log. Comput..

[40]  André Fuhrmann,et al.  Theory contraction through base contraction , 1991, J. Philos. Log..

[41]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[42]  V. S. Subrahmanian.  Amalgamating knowledge bases , 1994, TODS.