Karl Schlechta

Dov M. Gabbay, Karl Schlechta: Conditionals and Modularity in General Logics. Cognitive Technologies, Springer 2011, isbn 978-3-642-19067-4, pp. 1-221

Dov M. Gabbay, Karl Schlechta: Equilibria und weiteres Heiteres II. CoRR abs/1108.3033 (2011)

Dov M. Gabbay, Karl Schlechta: Logical Tools for Handling Change in Agent-Based Systems. Cognitive Technologies, Springer 2010, isbn 978-3-642-04406-9, pp. I-X, 1-305

Dov M. Gabbay, Karl Schlechta: Semantic interpolation. Journal of Applied Non-Classical Logics 20(4): 345-371 (2010)

Dov M. Gabbay, Karl Schlechta: A Theory of Hierarchical Consequence and Conditionals. Journal of Logic, Language and Information 19(1): 3-32 (2010)

Dov M. Gabbay, Karl Schlechta: A Comment on Work by Booth and Co-authors. Studia Logica 94(3): 403-432 (2010)

Dov M. Gabbay, Karl Schlechta: Defeasible inheritance systems and reactive diagrams. Logic Journal of the IGPL 17(1): 1-54 (2009)

Dov M. Gabbay, Karl Schlechta: Roadmap for preferential logics. Journal of Applied Non-Classical Logics 19(1): 43-95 (2009)

Dov M. Gabbay, Karl Schlechta: Independence - Revision and Defaults. Studia Logica 92(3): 381-394 (2009)

Karl Schlechta: Remarks on Inheritance Systems. CoRR abs/math/0611937 (2006)

Daniel J. Lehmann, Menachem Magidor, Karl Schlechta: Distance Semantics for Belief Revision. CoRR cs.AI/0202025 (2002)

Shai Berger, Daniel J. Lehmann, Karl Schlechta: Preferred History Semantics for Iterated Updates. CoRR cs.AI/0202026 (2002)

Daniel J. Lehmann, Menachem Magidor, Karl Schlechta: Distance Semantics for Belief Revision. J. Symb. Log. 66(1): 295-317 (2001)

Karl Schlechta, Jürgen Dix: Explaining updates by minimal sums. Theor. Comput. Sci. 266(1-2): 819-838 (2001)

Karl Schlechta, Laurent Gourmelen, Stéphanie Motré, Olivier Rolland, Bensalah Tahar: A New Approach to Preferential Structures. Fundam. Inform. 42(3-4): 391-410 (2000)

Karl Schlechta: New Techniques and Completeness Results for Preferential Structures. J. Symb. Log. 65(2): 719-746 (2000)

Karl Schlechta: Unrestricted preferential structures. J. Log. Comput. 10(4): 573-581 (2000)

Laurent Audibert, Cédric Lhoussaine, Karl Schlechta: Distance Based Revision of Preferential Logics. Logic Journal of the IGPL 7(4): 429-446 (1999)

Karl Schlechta: Results on infinite extensions. Journal of Applied Non-Classical Logics 1(1): 65-72 (1999)

Karl Schlechta: A Topological Construction of a Non-smooth Model of Cumulativity. J. Log. Comput. 9(4): 457-462 (1999)

Shai Berger, Daniel J. Lehmann, Karl Schlechta: Preferred History Semantics for Iterated Updates. J. Log. Comput. 9(6): 817-833 (1999)

Jürgen Dix, Karl Schlechta: Explaining Updates by Minimal Sums. FSTTCS 1999: 142-154

Karl Schlechta: Nonmonotonic Logics, Basic Concepts, Results, and Techniques. Lecture Notes in Computer Science 1187, Springer 1997, isbn 3-540-62482-1

Karl Schlechta: A Reduction of the Theory of Confirmation to the Notions of Distance and Measure. Logic Journal of the IGPL 5(1): 49-64 (1997)

Karl Schlechta: Filters and Partial Orders. Logic Journal of the IGPL 5(5): 753-772 (1997)

Karl Schlechta: A Two-Stage Approach to First Order Default Reasoning. Fundam. Inform. 28(3-4): 377-402 (1996)

Karl Schlechta: Completeness and Incompleteness for Plausibility Logic. Journal of Logic, Language and Information 5(2): 177-192 (1996)

Karl Schlechta: Some Completeness Results for Stoppered and Ranked Classical Preferential Models. J. Log. Comput. 6(4): 599-622 (1996)

Karl Schlechta: Some Completeness Results for Classical Preferential Models. Logic, Action, and Information 1996: 229-240

Karl Schlechta, Daniel J. Lehmann, Menachem Magidor: Distance Semantics for Belief Revision. TARK 1996: 137-145

Karl Schlechta: Some Completeness Results for Propositional Conditional Logics. Logic Journal of the IGPL 3(1): 111-115 (1995)

Karl Schlechta: Logic, Topology, and Integration. J. Autom. Reasoning 14(3): 353-381 (1995)

Karl Schlechta: Defaults as Generalized Quantifiers. J. Log. Comput. 5(4): 473-494 (1995)

Karl Schlechta: Preferential Choice Representation Theorems for Branching Time Structures. J. Log. Comput. 5(6): 783-800 (1995)

Karl Schlechta: A Two-Stage Approach to First Order Default Reasoning. ECSQARU 1995: 379-386

Karl Schlechta: A Reduction of the Theory of Confirmation to the Notions of Distance and Measure. ECSQARU 1995: 387-394

Karl Schlechta, David Makinson: Local and Global Metrics for the Semantics of Counterfactual Conditionals. Journal of Applied Non-Classical Logics 4(2): 129-140 (1994)

Karl Schlechta: Directly Sceptical Inheritance Cannot Capture the Intersection of Extensions. J. Log. Comput. 3(5): 455-467 (1993)

Franz Baader, Karl Schlechta: A Semantics for Open Normal Defaults via a Modified Preferential Approach. ECSQARU 1993: 9-16

Karl Schlechta: Some Results on Classical Preferential Models. J. Log. Comput. 2(6): 675-686 (1992)

Karl Schlechta: Results on Non-Monotonic Logics. IWBS Report 204 (1992)

David Makinson, Karl Schlechta: Floating Conclusions and Zombie Paths: Two Deep Difficulties in the ``Directly Skeptical'' Approach to Defeasible Inheritance Nets. Artif. Intell. 48(2): 199-209 (1991)

Karl Schlechta: Theory Revision and Probability. Notre Dame Journal of Formal Logic 32(2): 307-319 (1991)

Gerhard Brewka, David Makinson, Karl Schlechta: JTMS and Logic Programming. LPNMR 1991: 199-210

Karl Schlechta: Semantics for Defeasible Inheritance. ECAI 1990: 594-597

Gerhard Brewka, David Makinson, Karl Schlechta: Cumulative Inference Relations for JTMS and Logic Programming. Nonmonotonic and Inductive Logic 1990: 1-12

Karl Schlechta: Some results on theory revision. The Logic of Theory Change 1989: 72-92

Karl Schlechta: Remarks to Shoham's Temporal Logic. GWAI 1988: 88-95

Karl Schlechta: Remarks on Consistency and Completeness of Circumscription. GWAI 1988: 96-103