Results 11  20
of
21
A reflective extension of ELAN
 Electronic Notes in Theoretical Computer Science
, 1996
"... The expressivity of rewriting logic as metalogic has been already convincingly illustrated. The goal of this paper is to explore the reflective capabilities of ELAN, a language based on the concepts of computational systems and rewriting logic. We define a universal theory for the class of ELAN pro ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
The expressivity of rewriting logic as metalogic has been already convincingly illustrated. The goal of this paper is to explore the reflective capabilities of ELAN, a language based on the concepts of computational systems and rewriting logic. We define a universal theory for the class of ELAN programs and the representation function associated to this universal theory. Then we detail the effective transformations to implement and propose the definition of two builtin modules that provide the last step to get the reflective capabilities we want for the ELAN system. 1
MRG: Building planners for real world complex applications
 APPLIED ARTIFICIAL INTELLIGENCE
, 1994
"... ..."
Building and Executing Proof Strategies in a Formal Metatheory
 Advances in Artifical Intelligence: Proceedings of the Third Congress of the Italian Association for Artificial Intelligence, IA*AI'93, Volume 728 of Lecture Notes in Computer Science
, 1993
"... This paper describes how "safe" proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic tactics, is used to represent proof strategies. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes how "safe" proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic tactics, is used to represent proof strategies. The semantic attachment facility and the evaluation mechanism of the GETFOL system have been used to provide the procedural interpretation of logic tactics. The execution of logic tactics is then proved to be "safe" under the termination condition. The implementation within the GETFOL system is described and the synthesis of a logic tactic implementing a normalizer in negative normal form is presented as a case study. 1 Introduction As pointed out in [GMMW77], interactive theorem proving [GMW79, CAB + 86, Pau89] has been growing up in the continuum existing between proof checking [deB70, Wey80] on one side and automated theorem proving [Rob65, And81, Bib81] on the other. Interactive theorem...
Using reflection techniques for flexible . . .
"... Flexible problem solving consists of the dynamic selection and configuration of problem solving methods for a particular problem type, depending on the particular problem and the goal of problem solving. In this paper, we propose an architecture that supports such flexible problem solving automatica ..."
Abstract
 Add to MetaCart
Flexible problem solving consists of the dynamic selection and configuration of problem solving methods for a particular problem type, depending on the particular problem and the goal of problem solving. In this paper, we propose an architecture that supports such flexible problem solving automatically. For this purpose, problem solving methods are described in a uniform way, by an abstract model of components, which together define the functionality of the methods. Such an abstract model is used for dynamic selection and configuration of the problem solving methods. The proposed architecture for flexible problem solving consists of well known reflection techniques: two objectmeta relations, a definable naming mechanism and the axiomhood and theoremhood reflection rules. We have succeeded in using standard metaarchitecture techniques to enable flexible problem solving.
MultiAgent Reasoning with Belief Contexts III: Towards the Mechanization
, 1995
"... As discussed in previous papers, belief contexts are a powerful and adequate formalism for the representation of propositional attitudes in a multiagent environment. Belief contexts give also implementational advantages. In this paper we discuss the issues related to the practical use of belief cont ..."
Abstract
 Add to MetaCart
(Show Context)
As discussed in previous papers, belief contexts are a powerful and adequate formalism for the representation of propositional attitudes in a multiagent environment. Belief contexts give also implementational advantages. In this paper we discuss the issues related to the practical use of belief contexts, by showing the mechanized solution to some paradigmatic case studies. We show that this mechanization has the following implementational advantages. First, proofs have a natural interpretation, close to standard patterns in reasoning about propositional attitudes, and are based only on few conceptual reasoning steps: this makes proof search easier to understand and automatize. Furthermore, it is easier to implement inference strategies which exploit the structure of the problem. Finally, substantial parts of reasoning are local to contexts: this allows for the efficient use of general purpose deciders. 1 Introduction and motivations Belief contexts [6, 10, 11] are a formalism for the ...
Towards a Translation of Computer Algebra Algorithms into Tactics
, 1996
"... CAS 2 Abstract CAS 1 Function Mappings tactics plan result call Translator Interface Tactic Generator result call Figure 1: System architecture of sapper Unlike other proof planners a CAS does not have to search for a plan but only to assemble one as the algorithms have implicit knowledge of the ..."
Abstract
 Add to MetaCart
(Show Context)
CAS 2 Abstract CAS 1 Function Mappings tactics plan result call Translator Interface Tactic Generator result call Figure 1: System architecture of sapper Unlike other proof planners a CAS does not have to search for a plan but only to assemble one as the algorithms have implicit knowledge of the actual computation. Thus sapper can use a relatively simple tactic mechanism for constructing proof plans. It consists of a set of hierarchically structured tactics: ffl simple tactics corresponding to the application of one hypotheses in a proof. ffl complex tactics describing computational steps of computer algebraic algorithms; they are compositions of simple tactics with tacticals. 3 Towards a 1to1 Representation of Tactics and Algorithms Abstraction ND PROOF CA Tactics Expansion Representation simple CA Algorithm Metatheory correspond translation Framework Figure 2: Translations from tactics to algorithms The author has realized a first working implementation of the sappersyste...