Displaying similar documents to “The HeKatE methodology. Hybrid engineering of intelligent systems”

Some key research problems in automated theorem proving for hardware and software verification.

Matt Kaufmann, J. Strother Moore (2004)

RACSAM

Similarity:

This paper sketches the state of the art in the application of mechanical theorem provers to the verification of commercial computer hardware and software. While the paper focuses on the theorem proving system ACL2, developed by the two authors, it references much related work in formal methods. The paper is intended to satisfy the curiosity of readers interested in logic and artificial intelligence as to the role of mechanized theorem proving in hardware and software design today. In...

Defining the semantics of rule-based Web applications through model-driven development

Joaquín Cañadas, José Palma, Samuel Túnez (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Rule languages and inference engines incorporate reasoning capabilities to Web information systems. This paper presents an approach for the specification and development of Web applications performing the usual functionalities of data management and incorporating a rule engine for reasoning capabilities. The proposed approach is based on the definition of a high-level representation of the semantics of rule-based applications through a formalism for conceptual modeling combining lightweight...

From ignorance to uncertainty: a conceptual analysis

Pietro Baroni, Giovanni Guida, Silvano Mussi (1998)

Kybernetika

Similarity:

This paper aims to develop an analysis of how ignorance affects the reasoning activity and is related to the concept of uncertainty. With reference to a simple inferential reasoning step, involving a single piece of relational knowledge, we identify four types of ignorance and show how they give rise to different types of uncertainty. We then introduce the concept of reasoning attitude, as a basic choice about how reasoning should be carried out in presence of ignorance. We identify...

Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic

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....

Designing a Semantic Ground Truth for Mathematical Formulae

Sexton, Alan, Sorge, Volker, Suzuki, Masakazu

Similarity:

We report on a new project to design a semantic ground truth set for mathematical document analysis. The ground truth set will be generated by annotating recognised mathematical symbols with respect to both their global meaning in the context of the considered documents and their local function within the particular mathematical formula they occur. The aim of our work is to have a reliable database available for semantic classification during the formula recognition process with the...