نتایج جستجو برای: forward backward chaining

تعداد نتایج: 134260  

2006
Chuck Liang Dale Miller

There are a number of cut-free sequent calculus proof systems known that are complete for first-order intuitionistic logic. Proofs in these different systems can vary a great deal from one another. We are interested in providing a flexible and unifying framework that can collect together important aspects of many of these proof systems. First, we suggest that one way to unify these proof system...

2005
Sean Wilson Jacques D. Fleuriot

This paper outlines Geometry Explorer, a prototype system that allows users to create Euclidean geometry constructions using a dynamic geometry interface, specify conjectures about them and then use a full-angle method prover to automatically produce diagram independent, human-readable proofs to theorems. Our system can then automatically generate novel diagrammatic proofs of the forward-chaini...

2003
Judy van Biljon Karen Renaud

Curriculum planning for students in a university which offers full-time as well as part-time courses is not a trivial task and is complicated by the fact that students can enrol for modules at different levels concurrently. A prototype advisory support tool was developed to address the problems related to documentbased advising. The tool supports two interactive advice approaches – a top-down b...

Journal: :J. Information Science 2013
Dong-Hyuk Im Sang-Won Lee Hyoung-Joo Kim

Recent studies on change detection for RDF data have focused on minimizing the delta size and, as a way to exploit the semantics of RDF models in reducing the delta size, the forward-chaining inferences have been widely employed. However, since the forwardchaining inferences should pre-compute the entire closure of the RDF model, the existing approaches are not scalable to large RDF data sets. ...

2003
Wojciech Jamroga

In this paper, we consider planning for multi-agents situations in STRIPS-like domains with planning graph. Three possible relationships between agents’ goals are considered in order to evaluate plans: the agents may be collaborative, adversarial or indifferent entities. We propose algorithms to deal with each situation. The collaborative situations can be easily dealt with the original Graphpl...

1993
Robert Demolombe

A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a general Least Fixpoint operator that operates on meta rules. Each set of meta rules represents a different strategy, and this allows an easy comparison. We first consider Deductive Databases with Horn clauses and we prese...

2015
Dewa Gede Hendra Divayana

Digital library is a very interesting phenomenon in the world of libraries. In this era of globalization, the digital library is needed by students, faculty, and the community in the search for quick reference through internet access, so that students, faculty, and the community does not have to come directly to the library. Accessing collections of digital libraries can also be done anytime an...

2014
Dewa Gede Hendra Divayana

Farming is one of the activities that have a business opportunity. One is raising ducks. The main results can be obtained from the breeding duck is a duck meat and eggs for consumption and also means praying ceremony in Bali, as well as duck egg shells that can be used for jewelry. Since the outbreak of avian influenza began in 2008, have an impact on consumer demand of ducks decreased and cons...

2012
Luke Trodd James Harland John Thangarajah

BDI Deliberation cycle, linear logic, forward chaining, Lygon Agent solutions to programming problems are often based on the Belief-Desire-Intention (BDI) paradigm [12]. Beliefs represent what the agent believes to be the current state of the world. Desires specify the proactive behaviour of the agent, in that the agent works to make these true. Often desires can be mutually exclusive or contra...

2009
Emilian Pascalau Adrian Giurca

There is a large literature concerning rule engines (forward chaining or backward chaining). During the last thirty years there were various proposals such as RETE, TREAT and the derived Gator algorithm. Significantly, RETE was embedded into various expert systems such as Clips and its successor Jess, and Drools including in a number of commercial rule engines and was extended various times inc...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید