Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Beyond satisfiability: extensions and applications

From MaRDI portal
Publication:3564034
Jump to:navigation, search

DOI10.1007/978-1-4020-6254-4_17zbMATH Open1209.68506OpenAlexW150713232MaRDI QIDQ3564034FDOQ3564034


Authors: Natarajan Shankar Edit this on Wikidata


Publication date: 2 June 2010

Published in: Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-6254-4_17




Recommendations

  • Satisfiability checking: theory and applications
  • A Tutorial on Satisfiability Modulo Theories
  • Computer Aided Verification
  • Satisfiability modulo theories
  • A satisfiability procedure for quantified Boolean formulae


Mathematics Subject Classification ID



Cited In (8)

  • Extending the reach of SAT with many-valued logics
  • On an unsatisfiability-satisfiability prover
  • Title not available (Why is that?)
  • The big deal: applying constraint satisfaction technologies where it makes the difference
  • Satisfiability: where Theory meets Practice (Invited Talk).
  • Multi-valued extension of Putnam-Davis procedure
  • Title not available (Why is that?)
  • Title not available (Why is that?)





This page was built for publication: Beyond satisfiability: extensions and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564034)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3564034&oldid=16955080"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 01:52. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki