Results 1  10
of
15
CADE15  The 15th International Conference on Automated Deduction July 510, 1998, Lindau, Germany  Integration of Deductive Systems
, 1998
"... This paper highlights a project to integrate interactive and automated theorem proving in Software Verification. Its aim is to combine the advantages of the two paradigms. We focus on one particular application domain, which is deduction for the purpose of software verification. We report on the int ..."
Abstract
 Add to MetaCart
on the integration concepts, and on the experimental results with a prototype implementation. This paper is a short version of [1]. Automatic provers are very fast for the majority of the problems they can solve at all. With increasing complexity, response time increases dramatically. Beyond a certain problem size
Using CauseAndEffect Knowledge To Solve Many Previously Unsolvable Problems
"... The Explainer problem is to find explanations for the behaviors of systems that have been described by sets of causeandeffect statements. Causeandeffect statements can be used to describe a surprising large variety of different systems and situations. But it has generally been considered that th ..."
Abstract
 Add to MetaCart
that this problem is only solvable by combinatorially enumerating all conceivable explanations and testing each by deduction to see if its consequences included the behavior to be described. That is, the Explainer problem has been considered to be NPcomplete. If true, this would make the computing times completely
Model Generation Theorem Proving with
, 2000
"... Model generation theorem proving (MGTP) is a class of deduction procedures for rstorder logic that were successfully used to solve hard combinatorial problems. For some applications the representation of models in MGTP and its extension CMGTP is too redundant. ..."
Abstract
 Add to MetaCart
Model generation theorem proving (MGTP) is a class of deduction procedures for rstorder logic that were successfully used to solve hard combinatorial problems. For some applications the representation of models in MGTP and its extension CMGTP is too redundant.
The development of scientific reasoning skills
 Developmental Review
, 2000
"... The purpose of this article is to provide an introduction to the growing body of research on the development of scientific reasoning skills. The focus is on the reasoning and problemsolving strategies involved in experimentation and evidence evaluation. Research on strategy use in science has unde ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
inquiry to reasoning or problemsolving situations This approach has historical roots in experimental psychology, in the body of research on reasoning and problem solving (e.g., In addition to examining the deductive components of scientific inference, Initial investigations with adults focused on a
Model Generation Theorem Proving with Finite Interval Constraints
"... . Model generation theorem proving (MGTP) is a class of deduction procedures for rstorder logic that were successfully used to solve hard combinatorial problems. For some applications the representation of models in MGTP and its extension CMGTP is too redundant. Here we suggest to extend member ..."
Abstract
 Add to MetaCart
. Model generation theorem proving (MGTP) is a class of deduction procedures for rstorder logic that were successfully used to solve hard combinatorial problems. For some applications the representation of models in MGTP and its extension CMGTP is too redundant. Here we suggest to extend
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family... Résumé ..."
Generating Motor Behavior
, 1986
"... Problem solving has long been of interest in the study of artificial intelligence and involves two questions: (1) how a domain can be captured so that problems of interest and their solutions are expressible and (2) given a problem how can one of its solutions be found within the finite computationa ..."
Abstract
 Add to MetaCart
computational resources available, that is, how can a problem solver exhibit goodperformance. This work addresses the latter question and in particular focuses on how solutions can be efficiently generated. Our hypothesis is that good problem solving performance results from exploiting combinatorial properties
Specifying Simple Scheduling Tasks in a Reflective and Modular Architecture
, 1993
"... this paper we present a system (MILORD II) that proposes particular solutions to these problems. Incompleteness of the available knowledge may lead to make assumptions in order to carry on a deduction process, even if later on these assumptions are proved to be erroneous. Then the reasoning process ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
this paper we present a system (MILORD II) that proposes particular solutions to these problems. Incompleteness of the available knowledge may lead to make assumptions in order to carry on a deduction process, even if later on these assumptions are proved to be erroneous. Then the reasoning process
AN HYBRID APPROACH TO REAL COMPLEX SYSTEM OPTIMIZATION Application to satellite constellation design
"... Keywords: This paper presents some considerations about hybrid optimization algorithms useful to optimize real complex system. The given indication could be used by readers to conceive hybrid algorithms. These considerations have been deducted from a concrete application case: the satellites constel ..."
Abstract
 Add to MetaCart
constellations design problem. But each of the advanced techniques proposed in this paper are considered in a more general way to solve other problems. This problem is used to illustrate the techniques along the paper because it is grouping many characteristics (difficulties) of contemporary real complex systems
Costas Arrays
, 1990
"... The implementation of Costas Arrays in Refine (the language of the Kestral Institute Development SystemKIDS) is compared to solutions written in Prolog (with freeze), Pascal and CHIP. Costas Arrays 1 COSTAS ARRAYS IN REFINE In his paper on automated software development [Smith 90], Smith discuss ..."
Abstract
 Add to MetaCart
5 minutes for the same problem and handcoding the same algorithm in C reduces this execution time to about a 1 second. Since the algorithm that was chosen to solve this combinatorial problem in Refine was essentially a backtracking algorithm (branch and bound), it seemed interesting to compare
Results 1  10
of
15