Article

On Generating Small Clause Normal Forms

Authors:

Andreas Nonnengart,

Georg Rock,

Christoph WeidenbachAuthors Info & Claims

CADE-15: Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction

Pages 397 - 411

Published: 05 July 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Guller D(2018)Automated Deduction in Gödel LogicACM Transactions on Computational Logic10.1145/321881719:3(1-28)Online publication date: 30-Aug-2018
https://dl.acm.org/doi/10.1145/3218817
Wisniewski MSteen AKern KBenzmüller C(2016)Effective Normalization Techniques for HOLProceedings of the 8th International Joint Conference on Automated Reasoning - Volume 970610.1007/978-3-319-40229-1_25(362-370)Online publication date: 27-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-40229-1_25
Lescuyer SConchon S(2009)Improving Coq propositional reasoning using a lazy CNF conversion schemeProceedings of the 7th international conference on Frontiers of combining systems10.5555/1807707.1807727(287-303)Online publication date: 16-Sep-2009
https://dl.acm.org/doi/10.5555/1807707.1807727
Show More Cited By

Recommendations

Clause elimination for SAT and QSAT

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of ...
Lower bounds for width-restricted clause learning on formulas of small width
IJCAI'11: Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Clause learning is a technique used by backtracking-based propositional satisfiability solvers, where some clauses obtained by analysis of conflicts are added to the formula during backtracking. It has been observed empirically that clause learning does ...
On the relationship between LTL normal forms and Büchi automata
Theories of Programming and Formal Methods

In this paper, we revisit the problem of translating LTL formulas to Büchi automata. We first translate the given LTL formula into a special disjuctive-normal form (DNF). The formula will be part of the state, and its DNF normal form specifies the ...

Comments

Information & Contributors

Information

Published In

CADE-15: Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction

July 1998

440 pages

ISBN:3540646752

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 05 July 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Guller D(2018)Automated Deduction in Gödel LogicACM Transactions on Computational Logic10.1145/321881719:3(1-28)Online publication date: 30-Aug-2018
https://dl.acm.org/doi/10.1145/3218817
Wisniewski MSteen AKern KBenzmüller C(2016)Effective Normalization Techniques for HOLProceedings of the 8th International Joint Conference on Automated Reasoning - Volume 970610.1007/978-3-319-40229-1_25(362-370)Online publication date: 27-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-40229-1_25
Lescuyer SConchon S(2009)Improving Coq propositional reasoning using a lazy CNF conversion schemeProceedings of the 7th international conference on Frontiers of combining systems10.5555/1807707.1807727(287-303)Online publication date: 16-Sep-2009
https://dl.acm.org/doi/10.5555/1807707.1807727
Egly USeidl MWoltran S(2009)A solver for QBFs in negation normal formConstraints10.1007/s10601-008-9055-y14:1(38-79)Online publication date: 1-Mar-2009
https://dl.acm.org/doi/10.1007/s10601-008-9055-y
Egly USeidl MWoltran S(2006)A Solver for QBFs in Nonprenex FormProceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy10.5555/1567016.1567120(477-481)Online publication date: 22-May-2006
https://dl.acm.org/doi/10.5555/1567016.1567120
Jackson PSheridan D(2004)Clause form conversions for boolean circuitsProceedings of the 7th international conference on Theory and Applications of Satisfiability Testing10.1007/11527695_15(183-198)Online publication date: 10-May-2004
https://dl.acm.org/doi/10.1007/11527695_15
Weidenbach C(2001)Combining superposition, sorts and splittingHandbook of automated reasoning10.5555/778522.778536(1965-2013)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778536
Bittencourt GTonin I(2001)An Algorithm for Dual Transformation in First-Order LogicJournal of Automated Reasoning10.1023/A:101191703247027:4(353-389)Online publication date: 1-Nov-2001
https://dl.acm.org/doi/10.1023/A%3A1011917032470
Sutcliffe G(2000)The CADE-16 ATP System CompetitionJournal of Automated Reasoning10.1023/A:100639350109824:3(371-396)Online publication date: 1-Apr-2000
https://dl.acm.org/doi/10.1023/A%3A1006393501098

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Clause elimination for SAT and QSAT

Lower bounds for width-restricted clause learning on formulas of small width

On the relationship between LTL normal forms and Büchi automata

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations