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

Parallel cooperative propositional theorem proving

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

DOI10.1023/A:1018946526109zbMath0940.68120OpenAlexW1485312863MaRDI QIDQ1978017

Fumiaki Okushi

Publication date: 7 June 2000

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018946526109


zbMATH Keywords

parallel modocparallel satisfiability testing algorithm


Mathematics Subject Classification ID


Related Items (4)

Computing Maximal Autarkies with Few and Simple Oracle Queries ⋮ Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets ⋮ Autark assignments of Horn CNFs ⋮ Investigations on autark assignments






This page was built for publication: Parallel cooperative propositional theorem proving

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