The following pages link to (Q4411161):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Effectivity functions and efficient coalitions in Boolean games (Q383078) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- Lost in translation: language independence in propositional logic -- application to belief change (Q490446) (← links)
- How to deal with unbelievable assertions (Q524943) (← links)
- Belief extrapolation (or how to reason about observations and unpredicted change) (Q543623) (← links)
- Forgetting for knowledge bases in DL-lite (Q604910) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Semantic forgetting in expressive description logics (Q831928) (← links)
- Propositional relevance through letter-sharing (Q846520) (← links)
- Dependencies between players in Boolean games (Q962907) (← links)
- Reasoning under inconsistency: a forgetting-based approach (Q991019) (← links)
- Introspective forgetting (Q1036061) (← links)
- Knowledge forgetting: properties and applications (Q1045992) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Conditional independence in propositional logic. (Q1852858) (← links)
- Constrained consequence (Q1941731) (← links)
- A logic-algebraic tool for reasoning with knowledge-based systems (Q1994361) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- Similarity measures based on compiled arguments (Q2145999) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Explicating logical independence (Q2301324) (← links)
- Definability for model counting (Q2303508) (← links)
- FAME(Q): an automated tool for forgetting in description logics with qualified number restrictions (Q2305440) (← links)
- A model of three-way decisions for knowledge harnessing (Q2310297) (← links)
- Forgetting in multi-agent modal logics (Q2321251) (← links)
- On propositional definability (Q2389643) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Solving logic program conflict through strong and weak forgettings (Q2457621) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Forgetting in ASP: The Forgotten Properties (Q2835900) (← links)
- ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS (Q3462270) (← links)
- Dependencies Between Players in Boolean Games (Q3524987) (← links)
- Rule Calculus: Semantics, Axioms and Applications (Q3532483) (← links)
- Formal Properties of Modularisation (Q3631354) (← links)
- When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- A Syntactic Operator for Forgetting that Satisfies Strong Persistence (Q5108521) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- Forgetting-Based Inconsistency Measure (Q5268425) (← links)
- Forgetting Literals with Varying Propositional Symbols (Q5431427) (← links)
- Information Acquisition Under Resource Limitations in a Noisy Environment (Q5889794) (← links)
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions (Q6152662) (← links)
- On the role of logical separability in knowledge compilation (Q6494362) (← links)
- A new class of explanations for classifiers with non-binary features (Q6545524) (← links)
- Boosting definability bipartition computation using SAT witnesses (Q6545575) (← links)
- The ghosts of forgotten things: a study on size after forgetting (Q6560989) (← links)
- Reasoning about action and change (Q6602230) (← links)
