The following pages link to Pierre Marquis (Q201919):
Displaying 50 items.
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Lost in translation: language independence in propositional logic -- application to belief change (Q490446) (← links)
- On stratified belief base compilation (Q702098) (← links)
- (Q814604) (redirect page) (← links)
- \(\text{DA}^2\) merging operators (Q814605) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Reasoning under inconsistency: a forgetting-based approach (Q991019) (← links)
- Disjunctive merging: quota and Gmin merging operators (Q991021) (← links)
- On the merging of Dung's argumentation systems (Q1028950) (← links)
- Introspective forgetting (Q1036061) (← links)
- Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
- Resource-bounded paraconsistent inference (Q1419391) (← links)
- Boosting distance-based revision using SAT encodings (Q1679786) (← links)
- Conditional independence in propositional logic. (Q1852858) (← links)
- Definability for model counting (Q2303508) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Contraction in propositional logic (Q2374542) (← links)
- On propositional definability (Q2389643) (← links)
- On weakening strategies for PB solvers (Q2661358) (← links)
- Consequence finding algorithms (Q2752124) (← links)
- Knowledge compilation for closed world reasoning and circumscription (Q2761752) (← links)
- A Translation-Based Approach for Revision of Argumentation Frameworks (Q2938509) (← links)
- Propositional Update Operators Based on Formula/Literal Dependence (Q2946712) (← links)
- (Q2999197) (← links)
- (Q2999198) (← links)
- Handling controversial arguments (Q3400791) (← links)
- (Q3429018) (← links)
- On Supported Inference and Extension Selection in Abstract Argumentation Frameworks (Q3451164) (← links)
- Private Expansion and Revision in Multi-agent Settings (Q3451175) (← links)
- Contraction in Propositional Logic (Q3451176) (← links)
- Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach (Q3524986) (← links)
- Recovering Consistency by Forgetting Inconsistency (Q3532461) (← links)
- Bipolarity in bilattice logics (Q3537542) (← links)
- (Q3624046) (← links)
- Merging Qualitative Constraints Networks Using Propositional Logic (Q3638160) (← links)
- Aggregating Interval Orders by Propositional Optimization (Q3645319) (← links)
- (Q4279083) (← links)
- (Q4411139) (← links)
- (Q4411161) (← links)
- Computational Aspects of Quasi-Classical Entailment (Q4443010) (← links)
- (Q4475158) (← links)
- (Q4546713) (← links)
- (Q4576236) (← links)
- (Q4576242) (← links)
- Belief base rationalization for propositional merging (Q4612451) (← links)
- (Q4708929) (← links)
- Novelty in deductive databases (Q4716048) (← links)
- A Syntactical Approach to Qualitative Constraint Networks Merging (Q4933308) (← links)
- (Q4999265) (← links)
