𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fast Consequence Recognition Algorithm for Monadic Logical Programs

✍ Scribed by M.I. Kratko; G.S. Plechevich

Book ID
110312899
Publisher
SP MAIK Nauka/Interperiodica
Year
2001
Tongue
English
Weight
165 KB
Volume
62
Category
Article
ISSN
0005-1179

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast and elementary algorithm for digi
A fast and elementary algorithm for digital plane recognition
✍ Y. GΓ©rard πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 126 KB

A digital naive plane is a subset of points (x, y, z) ∈ Z 3 verifying a double inequality h ≀ ax + by + cz < h + max{|a|, |b|, |c|} where (a, b, c) ∈ R/ {(0,0,0)} and h ∈ R. Given a finite subset of Z 3 , a problem is to determine whether or not there exists a digital naive plane containing it. This