The following pages link to (Q4385525):
Displaying 50 items.
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- Outlier detection using default reasoning (Q2389688) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- On the computational complexity of coalitional resource games (Q2457612) (← links)
- Weak nonmonotonic probabilistic logics (Q2457653) (← links)
- New tractable classes for default reasoning from conditional knowledge bases (Q2502153) (← links)
- A split-combination approach to merging knowledge bases in possibilistic logic (Q2643150) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Probably approximately optimal satisficing strategies (Q2674195) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- (Q2741436) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- (Q2842877) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- The Complexity of One-Agent Refinement Modal Logic (Q2915064) (← links)
- Expressivity and Complexity of MongoDB Queries (Q3305353) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Strategic Agent Communication: An Argumentation-Driven Approach (Q3601795) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- (Q4536416) (← links)
- The expressive power of unique total stable model semantics (Q4572012) (← links)
- Lower complexity bounds for lifted inference (Q4592980) (← links)
- On randomized versus deterministic computation (Q4630263) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- A PARALLEL BEST-FIRST B&B ALGORITHM AND ITS AXIOMATIZATION (Q4819981) (← links)
- On the synchronization of semi-traces (Q5055913) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- The complexity of counting problems in equational matching (Q5210797) (← links)
- A uniform tableaux method for nonmonotonic modal logics (Q5235255) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Complexity and compilability of diagnosis and recovery of graph-based systems (Q5706510) (← links)
- The computational power of parsing expression grammars (Q5915559) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Belief revision and update: Complexity of model checking (Q5943121) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- The asymmetric median tree. --- A new model for building consensus trees (Q5961632) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
- An assessment of numerical techniques to find energy-minimizing microstructures associated with nonconvex potentials (Q6497741) (← links)
