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: 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 …first-order deontic-alethic logic (FODAL). The connections of FODAL with the modal logic QK and the description logic 𝒜ℒ𝒞𝒬ℐ have been investigated and, on top of the obtained theoretical results, a special tool providing automated support for consistency checks of a set of 𝒜ℒ𝒞𝒬ℐ-expressible deontic and alethic business rules has been implemented. Show more
Keywords: business rules, deontic rules, consistency, reasoning, ORM2
Citation: Fundamenta Informaticae, vol. 124, no. 4, pp. 543-560, 2013
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.
Citation: Fundamenta Informaticae, vol. 124, no. 4, pp. 561-575, 2013
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]