Knowledge compilation using constraint inheritance

نویسندگان

  • Rosemary Chabot
  • David C. Brown
چکیده

Design knowledge is continually refined and expanded through experience. This research is concerned with design knowledge expressed as constraints. A simple learning mechanism simulates an expert designer's ability to incrementally adjust her knowledge when presented with slightly new problems. In response to unsatisfied expectations during the design process the system will examine its general knowledge about the design artifact, discover some relevant constraining knowledge, and convert that knowledge into a design constraint for future use. This process, referred to as constraint inheritance, should automatically improve the problem-solving performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type Inference for Static Compilation of JavaScript (Extended Version)

We present a type system and inference algorithm for a rich subset of JavaScript equipped with objects, structural subtyping, prototype inheritance, and first-class methods. The type system supports abstract and recursive objects, and is expressive enough to accommodate several standard benchmarks with only minor workarounds. The invariants enforced by the types enable an ahead-of-time compiler...

متن کامل

Combining Stochastic Constraint Optimization and Probabilistic Programming - From Knowledge Compilation to Constraint Solving

We show that a number of problems in Artificial Intelligence can be seen as Stochastic Constraint Optimization Problems (SCOPs): problems that have both a stochastic and a constraint optimization component. We argue that these problems can be modeled in a new language, SC-ProbLog, that combines a generic Probabilistic Logic Programming (PLP) language, ProbLog, with stochastic constraint optimiz...

متن کامل

Semantics of an Anytime Family of Reasoners

An anytime family of propositional reasoners is a sequenceR0;R1; : : : of inference relations such that each Ri is sound, tractable, and makes more inferences than Ri 1, and each theory has a complete reasoner in the family. Anytime families are useful for resource-bounded reasoning in knowledge representation systems. Although several anytime families have been proposed in the literature, only...

متن کامل

An Investigation into Adaptive Shifting in Knowledge Transfer

Participants were trained on three knowledge types -exemplars, tactics, and constraints -and then thought aloud while solving a series of transfer problems. Results show that participants shift between the transfer mechanisms of analogy, knowledge compilation, and constraint violation depending on their prior knowledge and the characteristics of the transfer tasks.

متن کامل

Testing Three Theories of Knowledge Transfer

Three theories of knowledge transfer -analogy, knowledge compilation, and constraint violation -were tested across three transfer scenarios. Each theory was shown to predict human performance in distinct and identifiable ways on a variety of transfer tasks. Results support the hypothesis that there are multiple mechanisms of transfer and that a general theory of transfer must incorporate each m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • AI EDAM

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1994