The problem of automatic query expansion is studied in the context of a logic-based information retrieval system that employs-in contrast to approaches based on deduc-tive reasoning-an abductive inference engine. Given a query, the abduction process yields a set of possible expansions to the query. An architecture for an interactive retrieval system based on abduction is proposed comprising a s...

This paper presents a mapping solution from ERDF(S) to Take vocabulary. The work is related to an investigation of integrating ERDF Derivation Rules into Take inference engine. Some steps are required to finalize this task: a mapping between ERDF(S) and Take vocabulary, integration of ERDF knowledge base in Take, and empowering Take inference engine to deal with both Closed World Assumption and...

ÐThis paper investigates the problem of inference channels that occur when database constraints are combined with nonsensitive data to obtain sensitive information. We present an integrated security mechanism, called the Disclosure Monitor, which guarantees data confidentiality by extending the standard mandatory access control mechanism with a Disclosure Inference Engine. The Disclosure Infere...

This paper reports on the implementation and analysis of the MP reener, the rst parallel interactive theorem prover. The MP reener is a shared memory multi-processor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the reener. The MP reener is a collection of threads operating as sequential reeners running on separate processors. Concurrent tactics exploi...

Mobile and wireless devices suffer from technological limitations such as limited battery life and limited memory size. Hence, use of technologies for mobile applications is confined to those technologies that are faster and take small footprint in memory. Firstly, this paper presents a survey of technologies that can be used for realization of inference engine, satisfying the qualities mention...

An inference engine for a hybrid representation scheme based on neurules is presented. Neurules are a kind of hybrid rules that combine a symbolic (production rules) and a connectionist representation (adaline unit). The inference engine uses a connectionist technique, which is based on the ‘firing potential’, a measurement of the firing tendency of a neurule, and symbolic pattern matching. It ...

Recent progress in DNA micro-array techniques enables us to obtain a massive amount of gene expression profiles simultaneously. Using the expression profiles we infer a gene network hiding the obtained data. Although several inference methods have been presented, most of them are insufficient in terms of reliability and processing time [1]. To overcome the problem, we develop an inference engin...

This paper presents a mapping solution from ERDF(S) to Take vocabulary. The work is related to an investigation of integrating ERDF Derivation Rules into Take inference engine. Some steps are required to finalize this task: a mapping between ERDF(S) and Take vocabulary, integration of ERDF knowledge base in Take, and empowering Take inference engine to deal with both Closed World Assumption and...

The Knowledge Representation Package consist of a framework that implement several kinds of processing engines. The framework using a data structure based on the Blackboard pattern [2], is written in Java and has three main components: knowledge representation, knowledge repository and inference engine. It can be used for make reasoning in semantic networks, frames or rule based systems. In inf...

Combining Answer Set Programming (ASP) and Constraint Logic Programming (CLP) can create a more powerful language for knowledge representation and reasoning. The language AC(C) is designed to integrate ASP and CLP. Compared with existing integration of ASP and CSP, AC(C) allows representing user-defined constraints. Such integration provides great power for applications requiring logical reason...