In this paper we discuss a semantics for translating natural language statements into facts of an underlying expert system, replacing the more conventional menu interface for gathering data from the user. We describe two issues that must be considered when building such an interface for an expert system. These issues are semantic processing of the user statements and the design of an interprete...

In the past decade various semantic relatedness, similarity, and distance measures have been proposed which play a crucial role in many NLP-applications. Researchers compete for better algorithms (and resources to base the algorithms on), and often only few percentage points seem to suffice in order to prove a new measure (or resource) more accurate than an older one. However, it is still uncle...

In intuitionistic sequent calculi, detecting that a sequent is unprovable is often used to direct proof search. This is for instance seen in backward chaining, where an unprovable subgoal means that the proof search must backtrack. In undecidable logics, however, proof search may continue indefinitely, finding neither a proof nor a disproof of a given subgoal. In this paper we characterize a fa...

We present a proof procedure that combines backward reasoning with logic programs and forward reasoning with integrity constraints. We illustrate the use of the proof procedure as the inference engine underlying agents. Roughly speaking, the backward reasoning component of the proof procedure is responsible for the deliberative behaviour of agents, whereas the forward reasoning component is res...

Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed search methods with their well-known deficiencies are prone to compromise declarativity, the primary concern of rule languages. The paper presents a new family of uninformed search algorithms that combine the advantages of the tradit...

We investigate the application of machine learning paradigms [2, 4, 3] in automated reasoning for improving a theorem prover by reusing previously computed proofs [7]. Assume that we have already computed a proof P of a conjecture φ := ¡∀u plus(sum(x), sum(u)) ≡ sum(append(x, u))¢ → plus(sum(add(n, x)), sum(y)) ≡ sum(append(add(n, x), y)) from a set of axioms AX . The schematic conjecture Φ := ...

This paper shows a method for finding topic-centric experts from open access metadata and full text documents. Topic-centric information including experts is served on OntoFrame, which is a Semantic Web-based academic research information service supporting R&D activities. URI schemebased OntoFrame provides three entity pages: topic, person, and event. ‘Persons by Topic’ in topic page lists up ...

2 AI in a New Millennium: Obstacles & Opportunities 2 2.1 AI as both Science and Engineering . . . . . . . . . . . . . . . . . . . . 2 2.2 Difficulties and how to address them. . . . . . . . . . . . . . . . . . . . . 4 2.3 Institutional and financial obstacles . . . . . . . . . . . . . . . . . . . . . 4 2.4 Failing to see problems: ontological blindness . . . . . . . . . . . . . . . 5 2.4.1 Wha...

Only one teaching material is held by the teacher, namely Al-Qur'an Hadith package book, even though teacher has a laptop and school projector as tool for developing learning media materials. However, teachers rarely develop materials they use. This study aims to determine validity practicality of e-modules based on Forward Backward Chaining. The method used R&D using ADDIE model. 20 studen...