José A. Alonso-Jiménez

Towards a practical argumentative reasoning with qualitative spatial databases

Classical database management can be flawed if the Knowledge database is built within a complex Knowledge Domain. We must then deal with inconsistencies and, in general, with anomalies of several types. In this paper we study computational and cognitive problems in dealing qualitative spatial databases.

A methodology for the computer-aided cleaning of complex knowledge databases

In environments with complex cognitive structure (such as semantic web or sophisticated spatial databases for geographical information systems), classical methods for detecting anomalies can be inadequate. In this paper the use of an automated theorem prover to detect anomalies in knowledge bases within a complex ontology is proposed. The authors argue that it will need to integrate such systems in some intelligent agents. The loss of real-time execution in some cases. is discussed with examples.

Verified Computer Algebra in Acl2

In this paper, we present the formal verification of a Common Lisp implementation of Buchberger’s algorithm for computing Grobner bases of polynomial ideals. This work is carried out in the Acl2 system and shows how verified Computer Algebra can be achieved in an executable logic.

Ontology cleaning by mereotopological reasoning

A mereotopological semantics to manage ontologies is presented. The aim is to provide a formal basis for ontology cleaning. It allows us to arrange, in a consistent manner, the concepts in early steps of the building of an ontology as well as to repair anomalies. The semantics supports cleaning cycle that combines several AI techniques as closed world assumption, default reasoning on taxonomies and knowledge acquisition.

Formally Verified Tableau-Based Reasoners for a Description Logic

Description Logics are a family of logics used to represent and reason about conceptual and terminological knowledge. One of the most basic description logics is

Logic Databases and Inconsistency Handling

{\mathcal{ALC}}

A Certified Polynomial-Based Decision Procedure for Propositional Logic

, used as a basis from which to obtain others. Description logics are particularly important to provide a logical basis for the web ontology languages (such as OWL) used in the Semantic Web. In order to increase the reliability of the Semantic Web, formal methods can be applied, and in particular formal verification of its reasoning services can be carried out. In this paper, we present the formal verification of a tableau-based satisfiability algorithm for the logic

A Quasi-Metric for Machine Learning

{\mathcal{ALC}}

A logic-algebraic tool for reasoning with Knowledge-Based Systems

. The verification has been completed in several stages. First, we develop an abstract formalization of satisfiability-checking of

Formal reasoning about efficient data structures: A case study in ACL2

{\mathcal{ALC}}