Pages that link to "Item:Q1924776"
From MaRDI portal
The following pages link to Propositional truth maintenance systems: Classification and complexity analysis (Q1924776):
Displaying 12 items.
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Truth maintenance systems. ECAI '90 Workshop, Stockholm, Sweden, August 6, 1990. Proceedings (Q1202063) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set (Q2661527) (← links)
- Support set selection for abductive and default reasoning (Q2674205) (← links)
- Logical characterizations of nonmonotonic TMSs (Q3975143) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)