Nonmonotonic Reasoning With Quantified Boolean Constraints

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-63255-7_3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Propositional PSPACE Reasoning With Boolean Programs Versus Quantified Boolean Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Experimenting With Nonmonotonic Reasoning

1995English

Nonmonotonic Reasoning

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1997English

Classical Methods in Nonmonotonic Reasoning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Hierarchic Autoepistemic Theories for Nonmonotonic Reasoning: Preliminary Report

1991English

The Complexity of Reasoning With Boolean Modal Logics

2002English

Learning and Verifying Quantified Boolean Queries by Example

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy