Search for Topics All Reviews
	Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Deduction And Theorem Proving (I.2.3) > Deduction (I.2.3...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 68 Reviews about "Deduction (I.2.3...)": Date Reviewed   Mathematical tools for data mining: set theory, partial orders, combinatorics Simovici D., Djeraba C.,  Springer Publishing Company, Incorporated, 2008. 628 pp. Type: Book (9781848002005) The dependence of data mining on mathematics, particularly on set theory, statistics, and linear algebra, is unquestionable. There are numerous examples that underline this reliance. For example, the task of frequent itemset mining is pertinent... Feb 6 2009   CLIP4: hybrid inductive machine learning algorithm that generates inequality rules Cios K., Kurgan L.  Information Sciences: an International Journal 163(1-3): 37-83, 2004. Type: Article This paper describes a hybrid learning algorithm that generates classification rules that use inequalities of the type attribute is not equal to value. The algorithm mixes a cover learning integer programming process with genetic learning, to... Oct 6 2004   GRAMY: a geometry theorem prover capable of construction Matsuda N., Vanlehn K.  Journal of Automated Reasoning 32(1): 3-33, 2004. Type: Article This substantial research paper seeks a natural deduction system for Euclidean (plane) geometry that includes the ability to make constructions. Prior work in geometry theorem proving either did not include this capability, was not a natural... Sep 20 2004   Developing industrial case-based reasoning applications: the INRECA methodology Bergmann R., Althoff K., Breen S., Goker M., Manago M.,  Springer-Verlag, London, UK, 2004. 236 pp. Type: Book (9783540207375) INRECA (induction and reasoning from cases) was developed by a European consortium of several firms and a German university, and its methodology is described in the first edition of this book [1]. The goal of the methodology is to... Jul 14 2004   Formalizing defeasible logic in CAKE Madaliska-Bugaj E., ukaszewicz W.  Fundamenta Informaticae 57(2-4): 193-213, 2003. Type: Article Defeasible logic (DL) is an efficient nonmonotonic logic. In the last few years, several variants of DL have been presented to deal with different, and sometimes incompatible, intuitions of nonmonotonic reasoning [1]. This paper discusses the... Jul 8 2004   Chu’s construction Bellin G.  In Logic for concurrency and synchronisation. Norwell, MA: Kluwer Academic Publishers, 2003. Type: Book Chapter The categorical study of linear logic is addressed in this chapter. Specifically, the author demonstrates that a particular functor pertaining to the abstract categorical model of linear logic can be constructed in purely proof-theoretical... Apr 26 2004   Applying GMDH algorithm to extract rules from examples Fujimoto K., Nakabayashi S.  Systems Analysis Modelling Simulation 43(10): 1311-1319, 2003. Type: Article This paper provides a clear example of how special issues of journals can relax scientific quality requirements. This is not the fault of the authors, who try to present a possibly interesting idea, but of the editor or reviewers of this special... Mar 5 2004   Developing a meta model for the Bunge---Wand---Weber ontological constructs Rosemann M., Green P.  Information Systems 27(2): 75-91, 2002. Type: Article Rosemann and Green consider some ontological constructs defined by Bunge, and made more specific in the context of information systems by Wand and Weber. These constructs provide a semantically clear and solid foundation for understanding and... Nov 19 2003   On the evaluation of agent behaviors: ghosts consensus method Mali A.  Artificial Intelligence 143(1): 1-17, 2003. Type: Article Behavior-based systems, a well-known paradigm for the design of distributed intelligent applications, are the focus of this paper. A behavior-based system is a collection of independent task-achieving modules, called behaviors, that operate in... Jul 15 2003   Conditional independence in propositional logic Lang J., Liberatore P., Marquis P.  Artificial Intelligence 141(1): 79-121, 2002. Type: Article This mathematical paper falls into the general framework of knowledge-based engineering. It focuses on the analysis of the problems underlying the use of relevance to improve inferences. In particular, the authors investigate the computational... Mar 26 2003       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2013 ThinkLoud, Inc. Terms of Use | Privacy Policy