A constructive proof of equivalence of formalism of DCG's with the formalism of type 0 phrase-structure grammars.
Prešić, Marica D., Prešić, Slaviša B. (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Prešić, Marica D., Prešić, Slaviša B. (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Andrzej Indrzejczak (2018)
Bulletin of the Section of Logic
Similarity:
In several applications of sequent calculi going beyond pure logic, an introduction of suitably defined rules seems to be more profitable than addition of extra axiomatic sequents. A program of formalization of mathematical theories via rules of special sort was developed successfully by Negri and von Plato. In this paper a general theorem on possible ways of transforming axiomatic sequents into rules in sequent calculi is proved. We discuss its possible applications and provide some...
Khotomski, Petar Z. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Beata Jankowska (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
Although the first rule-based systems were created as early as thirty years ago, this methodology of expert systems designing still proves to be useful. It becomes especially important in medical applications, while treating evidence given in an electronic format. Constructing the knowledge base of a rule-based system and, especially, of a system with uncertainty is a difficult task because of the size of this base as well as its heterogeneous character. The base consists of facts, ordinary...
E. López-Escobar (1991)
Fundamenta Mathematicae
Similarity:
Elnadi, Tarek Mohamed, Hoogewijs, Albert (1995)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
G. H. Matthews (1965)
Kybernetika
Similarity:
R. P. Nederpelt (1977)
Zbornik Radova
Similarity:
María Fernández, Ernestina Menasalvas, Óscar Marbán, José Peña, Socorro Millán (2001)
International Journal of Applied Mathematics and Computer Science
Similarity:
Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing...
Mirjana Isaković Ilić (2007)
Publications de l'Institut Mathématique
Similarity:
Adam Meissner (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning....