Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Chapman And Hall/CRC

9781439801673, 9781439801741

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Sets, lattices, and Boolean algebras

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch1 ◽

2009 ◽

pp. 1-9

Keyword(s):

Boolean Algebras

References

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.bmatt ◽

2009 ◽

pp. 343-346

Front Matter

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.fmatt ◽

2009 ◽

pp. i-ix

Polynomial cases of SAT

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch9 ◽

2009 ◽

pp. 165-204

Conclusions

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch15 ◽

2009 ◽

pp. 339-341

Computational knowledge representation with SAT ‚Äì getting started

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch12 ◽

2009 ◽

pp. 253-284

Keyword(s):

Knowledge Representation

Introduction to propositional logic

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch2 ◽

2009 ◽

pp. 11-43

Keyword(s):

Propositional Logic

Computational knowledge representation with SAT ‚Äì handling constraint satisfaction

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch13 ◽

2009 ◽

pp. 285-319

Keyword(s):

Knowledge Representation ◽

Constraint Satisfaction

Coding runs of Turing machines, NP-completeness and related topics

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch11 ◽

2009 ◽

pp. 227-252

Keyword(s):

Turing Machines ◽

Np Completeness

Clausal logic and resolution

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability ◽

10.1201/9781439801741.ch7 ◽

2009 ◽

pp. 101-132

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of SatisfiabilityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Chapman And Hall/CRC

Sets, lattices, and Boolean algebras

References

Front Matter

Polynomial cases of SAT

Conclusions

Computational knowledge representation with SAT ‚Äì getting started

Introduction to propositional logic

Computational knowledge representation with SAT ‚Äì handling constraint satisfaction

Coding runs of Turing machines, NP-completeness and related topics

Clausal logic and resolution

Chapman & Hall/CRC Studies in Informatics Series - Introduction to Mathematics of Satisfiability
Latest Publications