Propositional PSPACE Reasoning With Boolean Programs Versus Quantified Boolean Formulas

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-27836-8_96
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Nonmonotonic Reasoning With Quantified Boolean Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Inference and Learning in Probabilistic Logic Programs Using Weighted Boolean Formulas

Theory and Practice of Logic Programming
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceArtificial IntelligenceSoftware
2014English

The Complexity of Reasoning With Boolean Modal Logics

2002English

Learning and Verifying Quantified Boolean Queries by Example

2013English

Possibilistic Boolean Games: Strategic Reasoning Under Incomplete Information

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Spherical Constraint in Boolean Quadratic Programs

Journal of Global Optimization
ControlOptimizationApplied MathematicsManagement ScienceComputer Science ApplicationsOperations Research
2007English

Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability

IPSJ Transactions on System LSI Design Methodology
Electronic EngineeringComputer Science ApplicationsElectrical
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy