Bilginin tanımı problemi kelâm ve felsefe geleneklerinde tartışılmış, özel-likle mantık tanım teorisinin disiplinine dâhil olması ile birlikte müte-kaddimûn döneminde ortaya konan tarifler sonraki dönem düşünürler tara-fından tenkit edilmiştir. Temelde bilginin zarûrî mi yoksa kesbî olduğu sorunu etrafında şekillenen bu tartışmaya olan Şemseddin es-Semerkandî (ö. 722/1322), gerek İbn Sînâ’nın e...

We describe a technique for improving problemsolving performance by creating concepts that allow problem states to be evaluated through an efficient recognition process. A temporakdiflerence (TD) method is used to bootstrap a collection of useful concepts by backing up evaluations from recognized states to their predecessors. This procedure is combined with explanationbased generalization (EBG)...

This chapter uses three differently sized versions of an illustrative problem that has considerable regularity, symmetry, and homogeneity in its problem environment to compare genetic programming with and without the newly developed mechanism of automatic function definition. Genetic programming with automatic function definition can automatically decompose a problem into simpler subproblems, s...

We model unawareness of possibilities in decision-making and (linguistic) pragmatic reasoning. A background model is filtered through a state of limited awareness to provide the epistemic state of an agent who is not attending to all possibilities. We extend the standard notion of awareness with assumptions (implicit beliefs about propositions the agent is unaware of) and define a dynamic updat...

We present algorithms for computing A-sufficient substitutions and constraint sets together with the def'miens operation. These operations are primitive operations in the language GCLA. The paper first defines those primitives, which together form a dual rule to SLD resolution, and then describes the different algorithms and some of their properties together with examples. One of the algorithms...

The fundamental proposal in this article is that logical formulas of the form (f ↔ ¬f) are not contradictions, and that formulas of the form (t ↔ t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead reason to conclude that f and t have a third truth value, different from true and false. These formulas are circular definitions of f and t. We can interpret the i...