Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.Price: EUR 410.00
Impact Factor 2019: 1.204
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.
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 …been integrated as a tactic into the NUPRL system but it can be combined with other proof methods as well. Show more
Keywords: theorem proving, program synthesis, induction
Citation: Fundamenta Informaticae, vol. 39, no. 1,2, pp. 189-209, 1999
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 …rational and real), and hybrid parametrization algorithms (they combine parametrization and reparametrization techniques to derive algebraically optimal rational real parametrizations). Show more
Citation: Fundamenta Informaticae, vol. 39, no. 1,2, pp. 211-228, 1999
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
Free service line: 400 661 8717
Fax: +86 10 8446 7947
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]