𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Real functions incrementally computable by finite automata

✍ Scribed by Michal Konečný

Book ID
108280906
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
351 KB
Volume
315
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Function evaluation by incremental compu
Function evaluation by incremental computation, with applications
✍ Hanoch Ur; Chaim D. Shen-Orr 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Simulation of physical systems often requires repetitive evaluation of functions such as sine, cosine, exponential etc. The arguments of these functions are physical quantities, which usually change very little from one computation cycle to the next. An approach to function evaluation is proposed, w

Computing finite models by reduction to
Computing finite models by reduction to function-free clause logic
✍ Peter Baumgartner; Alexander Fuchs; Hans de Nivelle; Cesare Tinelli 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Recent years have seen considerable interest in procedures for computing finite models of first-order logic specifications. One of the major paradigms, MACE-style model building, is based on reducing model search to a sequence of propositional satisfiability problems and applying (efficient) SAT sol