Results 1  10
of
13
OPlan: the Open Planning Architecture
, 1990
"... OPlan is an AI planner based on previous experience with the Nonlin planner and its derivatives. Nonlin and other similar planning systems had limited control architectures and were only partially successful at limiting their search spaces. OPlan is a design and implementation of a more flexible s ..."
Abstract

Cited by 364 (41 self)
 Add to MetaCart
(Show Context)
OPlan is an AI planner based on previous experience with the Nonlin planner and its derivatives. Nonlin and other similar planning systems had limited control architectures and were only partially successful at limiting their search spaces. OPlan is a design and implementation of a more flexible system aimed at supporting planning research and development, opening up new planning methods and supporting strong search control heuristics. OPlan takes an engineering approach to the construction of an efficient domain independent planning system which includes a mixture of AI and numerical techniques from Operations Research. The main contributions of the work are centred around the control of search within the OPlan planning framework, and this paper outlines the search control heuristics employed within the planner. These involve the use of condition typing, time and resource constraints and domain constraints to allow knowledge about an application domain to be used to prune the searc...
The Use of Explicit Plans to Guide Inductive Proofs
 9TH CONFERENCE ON AUTOMATED DEDUCTION
, 1988
"... We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these specifications in a sorted metalogic, we are able to reason about the conjectures ..."
Abstract

Cited by 290 (39 self)
 Add to MetaCart
We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these specifications in a sorted metalogic, we are able to reason about the conjectures to be proved and the methods available to prove them. In this way we can build proof plans of wide generality, formally account for and predict their successes and failures, apply them flexibly, recover from their failures, and learn them from example proofs. We illustrate this technique by building a proof plan based on a simple subset of the implicit proof plan embedded in the BoyerMoore theorem prover, [Boyer & Moore 79].
The use of proof plans to sum series
 lth Conference on Automated Deduction, ( 1992 ), Lecture Notes in Artificial Intelligence 607
, 1992
"... We describe a program for nding closed form solutions to nite sums. The program was built to test the applicability of the proof planning search control technique in a domain of mathematics outwith induction. This experiment was successful. The series summing program extends previous work in this ar ..."
Abstract

Cited by 26 (16 self)
 Add to MetaCart
(Show Context)
We describe a program for nding closed form solutions to nite sums. The program was built to test the applicability of the proof planning search control technique in a domain of mathematics outwith induction. This experiment was successful. The series summing program extends previous work in this area and was built in a short time just by providing new series summing methods to our existing inductive theorem proving system CLAM. One surprising discovery was the usefulness of the ripple tactic in summing series. Rippling is the key tactic for controlling inductive proofs, and was previously thought to be specialised to such proofs. However, it turns out to be the key subtactic used by all the main tactics for summing series. The only change required was that it had to be supplemented by a dierence matching algorithm to set up some initial metalevel annotations to guide the rippling process. In inductive proofs these annotations are provided by the application of mathematical induction. This evidence suggests that rippling, supplemented by dierence matching, will nd wide application in controlling mathematical proofs. 1
MetaLevel Inference Systems
, 1991
"... 1.1 Goals of this book................................ 13 ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
1.1 Goals of this book................................ 13
The Use of Proof Plans for Normalization
 Essays in Honor of Woody Bledsoe
, 1992
"... We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some generalpurpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some generalpurpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of these normalizers so that they can interact with the theorem prover in which they are embedded. We intend to extend this technique to decision procedures. 1 Introduction In [Boyer & Moore 88], Boyer and Moore investigate a case study in the use of decision procedures in automated deduction, namely a decision procedure for linear arithmetic. Their conclusions were as follows. ffl Such decision procedures have a vital role to play in reducing the combinatorial explosion, but ffl they cannot be treated as black boxes. In practice, few subgoals exactly fit the requirements of a decision procedure, but many almost do. In these cases it is necessary to augment the decision procedure with ad...
Planning and patching proof
 In Arti¯cial Intelligence and Symbolic Computation (AISC
, 2004
"... ..."
The Specialization and Transformation of Constructive Existence Proofs
 PROCEEDINGS OF THE ELEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTI INTELLIGENCE
, 1989
"... The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adapting programs to special situations by transforming constructive synthesis proofs has been reconstructed and is compared wit ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adapting programs to special situations by transforming constructive synthesis proofs has been reconstructed and is compared with the original implementation [Goad 80]. A brief account of more general proof transformation applications is also presented. The overall moral is that constructiveexistence proofs contain more information over and above that required for simple execution and that this can be exploited by a proof transformation system.
F.: A semantic framework for knowledge management in virtual innovation factories
 International Journal of Information
"... Knowledge management is a crucial aspect for enterprises that want to effectively cope with business innovation. However, the full control of the knowledge asset is often missing due to the lack of precise organizational models, policies, and proper technologies, especially in Virtual Enterprises (V ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Knowledge management is a crucial aspect for enterprises that want to effectively cope with business innovation. However, the full control of the knowledge asset is often missing due to the lack of precise organizational models, policies, and proper technologies, especially in Virtual Enterprises (VEs), which are characterized by heterogeneous partners with different policies, skills and knowhow. For such reasons, the need for technologies that enable knowledge sharing, efficient access to knowledge resources, and interoperability is felt as primary. This work proposes a semanticsbased infrastructure aimed at supporting effective knowledge management for business innovation in VEs. Knowledge resources are formally represented and stored in a semantic layer, which is exploited by a set of semantic services for enabling efficient retrieval and reasoning capabilities to derive additional knowledge.
Definite Integration of Parametric Rational Functions: Applying a DITLU
, 2000
"... In [2] we presented a Definite Integral Table Lookup (the DITLU) for parametric functions, including a minimal prototype implementation demonstrating its capabilities. In this paper we present a possible application of a DITLU, which would extend its utility for a modest investment of effort. The na ..."
Abstract
 Add to MetaCart
(Show Context)
In [2] we presented a Definite Integral Table Lookup (the DITLU) for parametric functions, including a minimal prototype implementation demonstrating its capabilities. In this paper we present a possible application of a DITLU, which would extend its utility for a modest investment of effort. The naive algorithm for indefinite integration of rational functions (see e.g. [12, x2.10]) can be implemented for parametric rational functions. This involves splitting the rational function integrand using partial fractions. The resulting integrands all fall within a limited class which may be covered in a DITLU by a very small number of table entries. Extensions of this idea to less naive integration algorithms, and the number of table entries required to implement them, are also considered.