Complexity Results for Default Reasoning from Conditional Knowledge Bases

No abstract is available for this paper.

• Publication year

  2000

• Venue

  International Conference on Principles of Knowledge Representation and Reasoning

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Defeasible Reasoning and Uncertainty Management Systems

  2000cited by this paper
• Fixed-parameter complexity in AI and nonmonotonic reasoning

  1999cited by this paper
• Maximum Entropy and Variable Strength Defaults

  1999influential reference
• On First-Order Conditional Logics

  1998cited by this paper
• Parameterized Complexity

  1998cited by this paper
• Complexity and expressive power of logic programming

  1997cited by this paper
• Nonmonotonic Reasoning, Conditional Objects and Possibility Theory

  1997cited by this paper
• Qualitative Probabilities for Default Reasoning, Belief Revision, and Causal Modeling

  1996influential reference
• How Hard is it to Revise a Belief Base

  1996cited by this paper
• Plausibility measures and default reasoning

  1996cited by this paper
• Feasibility and Unfeasibility of Off-Line Processing

  1996cited by this paper
• The Comparative Linguistics of Knowledge Representation

  1995cited by this paper
• Belief functions and default reasoning

  1995cited by this paper
• On the Complexity of Conditional Logics

  1994cited by this paper
• Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning

  1994cited by this paper
• The Complexity of Propositional Closed World Reasoning and Circumscription

  1994cited by this paper
• Conditional Objects as Nonmonotonic Consequence Relationships

  1994cited by this paper
• A Taxonomy of Complexity Classes of Functions

  1994cited by this paper
• Computing functions with parallel queries to NP

  1993cited by this paper
• Inconsistency Management and Prioritized Syntax-Based Entailment

  1993influential reference
• Propositional circumscription and extended closed-world reasoning are ΠP2-complete

  1993cited by this paper
• Representing Default Rules in Possibilistic Logic

  1992cited by this paper
• Conditional Entailment: Bridging two Approaches to Default Reasoning

  1992influential reference
• Default Reasoning: Causal and Conditional Theories

  1992influential reference
• A Promenade from Monotonicity to Non-Monotonicity Following a Theorem Prover

  1992cited by this paper
• The Complexity of Model Checking for Circumscriptive Formulae

  1992cited by this paper
• The Complexity of Propositional Default Logics

  1992influential reference
• Rank-based Systems: A Simple Approach to Belief Revision, Belief Update, and Reasoning about Evidence and Actions

  1992cited by this paper
• Complexity Results for Nonmonotonic Logics

  1992cited by this paper
• Hard problems for simple default logics

  1992cited by this paper
• On Truth-Table Reducibility to SAT

  1991cited by this paper
• On the Consistency of Defeasible Databases

  1991influential reference
• System-Z+: A Formalism for Reasoning with Variable-Strength Defaults

  1991cited by this paper
• S4 as the Conditional Logic of Nonmonotonicity

  1991cited by this paper
• A Catalog of Complexity Classes

  1991cited by this paper
• Possibilistic Logic, Preferential Models, Non-monotonicity and Related Issues

  1991cited by this paper
• Conditional Logics of Normality as Modal Systems

  1990cited by this paper
• It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics

  1990cited by this paper
• Bounded Query Classes

  1990cited by this paper
• A Maximum Entropy Approach to Nonmonotonic Reasoning

  1990cited by this paper
• Nonmonotonic Reasoning, Preferential Models and Cumulative Logics

  1990influential reference
• What does a Conditional Knowledge Base Entail?

  1989cited by this paper
• Probabilistic Semantics for Nonmonotonic Reasoning: A Survey

  1989influential reference
• Ordinal Conditional Functions: A Dynamic Theory of Epistemic States

  1988cited by this paper
• A semantical approach to nonmonotonic logics

  1987cited by this paper
• A First-Order Conditional Logic for Prototypical Properties

  1987cited by this paper
• The complexity of optimization problems

  1986cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• The logic of conditionals

  1975cited by this paper

• Belief change operations under confidentiality requirements in multiagent systems

  2014cites this paper
• Preserving confidentiality while reacting on iterated queries and belief revisions

  2013cites this paper
• Revising Belief without Revealing Secrets

  2012cites this paper
• New tractable classes for default reasoning from conditional knowledge bases

  2005influential citation
• Expressive Power and Succinctness of Propositional Languages for Preference Representation

  2004influential citation
• Logical Preference Representation and Combinatorial Vote

  2004influential citation
• Z-log: Applying System-Z

  2002cites this paper
• Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints

  2000cites this paper
• New Tractable Cases in Default Reasoning from Conditional Knowledge Bases

  2000cites this paper
• Probabilistic Default Reasoning with Conditional Constraints

  2000cites this paper