๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On-line 2-satisfiability

โœ Scribed by Brigitte Jaumard; Paola Marchioro; Aurora Morgana; Rossella Petreschi; Bruno Simeone


Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
538 KB
Volume
1
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Satisfiability on hypergraphs
โœ Adam Kolany ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 557 KB
Line rasterization algorithms that satis
โœ M.L.P van Lierop; C.W.A.M van Overveld; H.M.M van de Wetering ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science โš– 1016 KB

In this paper two subset line properties are introduced; the difference concerns the domain of the end points of the line segments under consideration, viz. Q\* and Z\* respectively. For both properties, a recursive and a nonrecursive algorithm to generate raster line segments are derived. All algor

On the satisfiability of circumscription
โœ Vladimir Lifschitz ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

Etherington, Mercer and Reiter showed, on the basis of ideas of Bossu and Siegel, that circumscription cannot lead to inconsistency for universal formulas. We extend this result in three directions: to formulas of a more general syntactic form, to circumscr~tion with some predicate symbols allowed t

Probabilistic satisfiability
โœ George Georgakopoulos; Dimitris Kavvadias; Christos H Papadimitriou ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 683 KB