scientific article; zbMATH DE number 1946872
From MaRDI portal
Publication:4411161
zbMath1056.68112MaRDI QIDQ4411161
Pierre Marquis, Paolo Liberatore, Jérôme Lang
Publication date: 7 July 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (44)
Information Acquisition Under Resource Limitations in a Noisy Environment ⋮ Semantic forgetting in expressive description logics ⋮ Propositional relevance through letter-sharing ⋮ Similarity measures based on compiled arguments ⋮ ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS ⋮ On propositional definability ⋮ What makes propositional abduction tractable ⋮ Semantic forgetting in answer set programming ⋮ Forgetting for knowledge bases in DL-lite ⋮ Effectivity functions and efficient coalitions in Boolean games ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Knowledge forgetting in propositional \(\mu\)-calculus ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Constrained consequence ⋮ Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions ⋮ Projection and scope-determined circumscription ⋮ Dependencies Between Players in Boolean Games ⋮ On the limits of forgetting in answer set programming ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ Solving logic program conflict through strong and weak forgettings ⋮ Redundancy in logic. I: CNF propositional formulae ⋮ Lost in translation: language independence in propositional logic -- application to belief change ⋮ On the Computational Complexity of Non-Dictatorial Aggregation ⋮ A logic-algebraic tool for reasoning with knowledge-based systems ⋮ How to deal with unbelievable assertions ⋮ Dependencies between players in Boolean games ⋮ Belief extrapolation (or how to reason about observations and unpredicted change) ⋮ Reasoning under inconsistency: a forgetting-based approach ⋮ Explicating logical independence ⋮ Formal Properties of Modularisation ⋮ Definability for model counting ⋮ On syntactic forgetting under uniform equivalence ⋮ FAME(Q): an automated tool for forgetting in description logics with qualified number restrictions ⋮ A model of three-way decisions for knowledge harnessing ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Introspective forgetting ⋮ Forgetting in multi-agent modal logics ⋮ Knowledge forgetting: properties and applications ⋮ Conditional independence in propositional logic. ⋮ Forgetting-Based Inconsistency Measure ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI ⋮ On the query complexity of selecting minimal sets for monotone predicates
This page was built for publication:
