Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath0990.90534MaRDI QIDQ2741518

Allen van Gelder

Publication date: 24 September 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

backtracking-search satisfiability algorithmlinear-time decision procedure


Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)


Related Items (2)

On Davis-Putnam reductions for minimally unsatisfiable clause-sets ⋮ Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases


Uses Software

  • SATO
  • DIMACS


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Eliminating dublication with the hyper-linking strategy
  • An efficient algorithm for the 3-satisfiability problem
  • Search algorithms in type theory
  • Lemma and cut strategies for propositional model elimination
  • A Computing Procedure for Quantification Theory
  • A machine program for theorem-proving




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2741518&oldid=15604907"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki