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 124, issue 4

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

Logic-based Reasoning Support for SBVR

Authors: Solomakhin, Dmitry | Franconi, Enrico | Mosca, Alessandro

Article Type: Research Article

Abstract: Automated support to enterprise modeling has increasingly become a subject of interest for organizations seeking solutions for storage, distribution and analysis of knowledge about business processes. This interest has recently resulted in approving the standard for specifying Semantics of Business Vocabulary and Business Rules (SBVR). Despite the existence of formally grounded notations, up to now SBVR still lacks a sound and consistent logical formalization which would allow developing automated solutions able to check the consistency of a set of business rules. This work reports on the attempt to provide logical foundations for SBVR by the means of defining a specific … Show more

Keywords: business rules, deontic rules, consistency, reasoning, ORM2

DOI: 10.3233/FI-2013-848

Citation: Fundamenta Informaticae, vol. 124, no. 4, pp. 543-560, 2013

Price: EUR 27.50

A Tabled Prolog Program for Solving Sokoban

Authors: Zhou, Neng-Fa | Dovier, Agostino

Article Type: Research Article

Abstract: This paper presents our program in B-Prolog submitted to the third ASP solver competition for the Sokoban problem. This program, based on dynamic programming, treats Sokoban as a generalized shortest path problem. It divides a problem into independent subproblems and uses mode-directed tabling to store subproblems and their answers. This program is very simple but quite efficient. Without use of any sophisticated domain knowledge, it easily solves 14 of the 15 instances used in the competition. We show that the approach can be easily applied to other optimization planning problems.

DOI: 10.3233/FI-2013-849

Citation: Fundamenta Informaticae, vol. 124, no. 4, pp. 561-575, 2013

Price: EUR 27.50

AUTHOR INDEX VOLUME 124

Article Type: Other

Citation: Fundamenta Informaticae, vol. 124, no. 4, pp. 577-578, 2013

Get PDF
Show more