You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 39, issue 1-2

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact Factor 2024: 0.4

Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:


- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.

Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.

results per page

Automating Inductive Specification Proofs

Authors: Pientka, Brigitte | Kreitz, Christoph

Article Type: Research Article

Abstract: We present an automatic method which combines logical proof search and rippling heuristics to prove specifications. The key idea is to instantiate meta-variables in the proof with a simultaneous match based on rippling/reverse rippling heuristic. Underlying our rippling strategy is the rippling distance strategy which introduces a new powerful approach to rippling, as it avoids termination problems of other rippling strategies. Moreover, we are able to synthesize conditional substitutions for meta-variables in the proof. The strength of our approach is illustrated by discussing the specification of the integer square root and automatically synthesizing the corresponding algorithm. The described procedure has … Show more

Keywords: theorem proving, program synthesis, induction

DOI: 10.3233/FI-1999-391210

Citation: Fundamenta Informaticae, vol. 39, no. 1-2, pp. 189-209, 1999

Price: EUR 27.50

Algorithms for Rational Real Algebraic Curves

Authors: Sendra, J. Rafael | Winkler, Franz

Article Type: Research Article

Abstract: In this paper, we study fundamental properties of real curves, especially of rational real curves, and we derive several algorithms to decide the reality and rationality of curves in the complex plane. Furthermore, if the curve is real and rational, we determine a real parametrization. More precisely, we present a reality test algorithm for plane curves, and three different types of real parametrization algorithms that we call: direct parametrization algorithms (they compute a rational real parametrization, if it exists), algebraically optimal parametrization algorithms (they compute a rational real parametrization over the smallest possible real field extension, if the curve is … Show more

DOI: 10.3233/FI-1999-391211

Citation: Fundamenta Informaticae, vol. 39, no. 1-2, pp. 211-228, 1999

Price: EUR 27.50
Show more