Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Classical propositional operators : an exercise in the foundations of logic / by Krister Segerberg
| Classical propositional operators : an exercise in the foundations of logic / by Krister Segerberg |
| Autore | Segerberg, Krister |
| Pubbl/distr/stampa | Oxford : Clarendon Press, 1982 |
| Descrizione fisica | x, 151 p. ; 24 cm. |
| Disciplina | 511.3 |
| Collana | Oxford logic guides ; 5 |
| Soggetto topico | Propositional calculus |
| ISBN | 0198531737 |
| Classificazione |
AMS 03B05
QA9.3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000744789707536 |
Segerberg, Krister
|
||
| Oxford : Clarendon Press, 1982 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Handbook of satisfiability [[electronic resource] /] / edited by Armin Biere ... [et al.]
| Handbook of satisfiability [[electronic resource] /] / edited by Armin Biere ... [et al.] |
| Pubbl/distr/stampa | Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 |
| Descrizione fisica | 1 online resource (980 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | BiereArmin |
| Collana | Frontiers in artificial intelligence and applications |
| Soggetto topico |
Propositional calculus
Decision making Computer algorithms Algebra, Boolean |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-4416-1678-0
1-60750-376-X 600-00-1439-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Title page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter Tractability
Part II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject Index Cited Author IndexContributing Authors and Affiliations |
| Record Nr. | UNINA-9910455344403321 |
| Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of satisfiability [[electronic resource] /] / edited by Armin Biere ... [et al.]
| Handbook of satisfiability [[electronic resource] /] / edited by Armin Biere ... [et al.] |
| Pubbl/distr/stampa | Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 |
| Descrizione fisica | 1 online resource (980 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | BiereArmin |
| Collana | Frontiers in artificial intelligence and applications |
| Soggetto topico |
Propositional calculus
Decision making Computer algorithms Algebra, Boolean |
| ISBN |
1-4416-1678-0
1-60750-376-X 600-00-1439-2 |
| Classificazione |
ST 125
ST 300 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Title page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter Tractability
Part II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject Index Cited Author IndexContributing Authors and Affiliations |
| Record Nr. | UNINA-9910778077003321 |
| Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of satisfiability / / edited by Armin Biere ... [et al.]
| Handbook of satisfiability / / edited by Armin Biere ... [et al.] |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 |
| Descrizione fisica | 1 online resource (980 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | BiereArmin |
| Collana | Frontiers in artificial intelligence and applications |
| Soggetto topico |
Propositional calculus
Decision making Computer algorithms Algebra, Boolean |
| ISBN |
1-4416-1678-0
1-60750-376-X 600-00-1439-2 |
| Classificazione |
ST 125
ST 300 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Title page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter Tractability
Part II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject Index Cited Author IndexContributing Authors and Affiliations |
| Record Nr. | UNINA-9910966771403321 |
| Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
R-Calculus, IV : propositional logic / / Wei Li and Yuefei Sui
| R-Calculus, IV : propositional logic / / Wei Li and Yuefei Sui |
| Autore | Li Wei |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (264 pages) |
| Disciplina | 810 |
| Collana | Perspectives in Formal Induction, Revision and Evolution |
| Soggetto topico | Propositional calculus |
| ISBN |
9789811986338
9789811986321 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- R-calculus for simplified propositional logics -- R-calculi for tableau/Gentzen deduction systems -- R-calculi RQ1Q2/RQ1Q2 -- R-calculi RQ1iQ2j/RQ1iQ2j -- R-Calculi: RY1Q1iY2Q2j/RY1Q1iY2Q2j -- R-calculi for supersequents -- R-calculi for propositional logic. |
| Record Nr. | UNINA-9910683352003321 |
|
Li Wei
|
||
| Singapore : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
R-Calculus, IV : propositional logic / / Wei Li and Yuefei Sui
| R-Calculus, IV : propositional logic / / Wei Li and Yuefei Sui |
| Autore | Li Wei |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Singapore : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (264 pages) |
| Disciplina | 810 |
| Collana | Perspectives in Formal Induction, Revision and Evolution |
| Soggetto topico | Propositional calculus |
| ISBN |
9789811986338
9789811986321 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- R-calculus for simplified propositional logics -- R-calculi for tableau/Gentzen deduction systems -- R-calculi RQ1Q2/RQ1Q2 -- R-calculi RQ1iQ2j/RQ1iQ2j -- R-Calculi: RY1Q1iY2Q2j/RY1Q1iY2Q2j -- R-calculi for supersequents -- R-calculi for propositional logic. |
| Record Nr. | UNISA-996546834003316 |
|
Li Wei
|
||
| Singapore : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
