Results 1  10
of
595
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
 Proceedings of ISSAC ’04, ACM Press
, 2004
"... Let n/d ∈ Q, mbe a positive integer and let u = n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d. A solution was first given by Wang in 1981. Wang’s algorithm outputs n/d when m>2M 2 where M =max(n,d). Because of the wi ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
Let n/d ∈ Q, mbe a positive integer and let u = n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d. A solution was first given by Wang in 1981. Wang’s algorithm outputs n/d when m>2M 2 where M =max(n,d). Because
On the Rational Reconstruction of our Theoretical Knowledge
"... This paper concerns the rational reconstruction of physical theories initially advanced by F. P. Ramsey and later elaborated by Rudolf Carnap. The Carnap–Ramsey reconstruction of theoretical knowledge is a natural development of classical empiricist ideas, one that is informed by Russell’s philosoph ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper concerns the rational reconstruction of physical theories initially advanced by F. P. Ramsey and later elaborated by Rudolf Carnap. The Carnap–Ramsey reconstruction of theoretical knowledge is a natural development of classical empiricist ideas, one that is informed by Russell’s
A rational reconstruction and extension of recursion analysis
 Proceedings of the Eleventh International Joint Conference on Artificial Intelligence
, 1989
"... The focus of this paper is the technique of recur8\on analysis. Recursion analysis is used by the BoyerMoore Theorem Prover to choose an appropriate induction schema and variable to prove theorems by mathematical induction. A rational reconstruction of recursion analysis is outlined, using the tech ..."
Abstract

Cited by 26 (13 self)
 Add to MetaCart
The focus of this paper is the technique of recur8\on analysis. Recursion analysis is used by the BoyerMoore Theorem Prover to choose an appropriate induction schema and variable to prove theorems by mathematical induction. A rational reconstruction of recursion analysis is outlined, using
Experimental results from a rational reconstruction of MINSTREL
 In Proceedings of the 2nd International Conference on Computational Creativity
, 2011
"... This paper presents results from a rational reconstruction project that is aimed at exploring the creative potential of Scott Turner’s 1993 MINSTREL system. In particular, we investigate the properties of Turner’s original system of TransformRecallAdapt Methods (TRAMs) and analyze the performance ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents results from a rational reconstruction project that is aimed at exploring the creative potential of Scott Turner’s 1993 MINSTREL system. In particular, we investigate the properties of Turner’s original system of TransformRecallAdapt Methods (TRAMs) and analyze the performance
A Rational Reconstruction of the PROTEUS Sentence Planner
 Proceedings of the Annual Conference on Computational Linguistics
, 1984
"... A revised and more structured version of Davey's discourse generation program has been implemented, which constructs the underlying forms for sentences and clauses by using rules which annotate and segment the initial sequence of events in various ways. i. The Proteus Program The text generatio ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A revised and more structured version of Davey's discourse generation program has been implemented, which constructs the underlying forms for sentences and clauses by using rules which annotate and segment the initial sequence of events in various ways. i. The Proteus Program The text generation program designed and implemented by Davey (1974,1978) achieved a high level of fluency in the generation of small paragraphs of English describing events in a limited domain (games of "tictactoe"/"noughtsandcrosses"). Although that work was completed ten years ago, the performance is still impressive by current standards. The program could play a game of "noughtsandcrosses " with a user, then produce a fluent sunmmry of what had happened during the game(whether or not the game was complete). For example: The game began with your taking a corner, and I took the middle of an adjacent edge. If you had taken the corner opposite the one which you had just taken, you would have threatened me, but you took the one adjacent to the square which I had just taken. The game hasn't finished yet. As well as heuristics for actually playing a game, the program contained rules for text generation, which could be regarded as having the following components (this is not a decomposition used by Davey, but an organisation imposed here in order to clarify the processing):
A rational reconstruction of a system for experimental mathematics
 Towards Mechanized Mathematical Assistants, Lecture Notes in Computer Science
, 2007
"... Over the last decade several environments and formalisms for the combination and integration of mathematical software systems have been proposed. Many of these systems aim at a traditional automated theorem proving approach, in which a given conjecture is to be proved or refuted by the cooperation o ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Over the last decade several environments and formalisms for the combination and integration of mathematical software systems have been proposed. Many of these systems aim at a traditional automated theorem proving approach, in which a given conjecture is to be proved or refuted by the cooperation of different reasoning engines. However, they offer little support for experimental mathematics in which new conjectures are constructed by an interleaved process of model computation, model inspection, property conjecture and verification. In particular, despite some previous research in that direction, there are currently no systems available that provide, in an easy to use environment, the flexible combination of diverse reasoning system in a plugandplay fashion via a high level specification of experiments. [2, 3] presents an integration of more than a dozen different reasoning systems — first order theorem provers, SAT solvers, SMT solvers, model generators, computer algebra, and machine learning systems — in a general bootstrapping algorithm to generate novel theorems in the specialised algebraic domain of
James Buchanan's Public Debt Theory: A Rational Reconstruction
"... Abstract James Buchanan's Public Principles of Public Debt is universally associated with the claim that debt allows the cost of public activity to be shifted onto future generations. This claim treats a generation as a unitary and acting entity. While such treatment is standard fare for macro ..."
Abstract
 Add to MetaCart
for macro theorists who work with representative agents and societal averages in place of the individuals who constitute a society, such treatment conflicts with Buchanan's Cost and Choice and, indeed, his entire oeuvre. This essay undertakes an act of rational reconstruction that renders his 1958
Results 1  10
of
595