• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Reasoning with Axioms: Theory and Practice
Reasoning with Axioms: Theory and Practice

... to an arbitrary set of axioms is hard, even for relatively inexpressive logics, and it is essential to deal with such axioms in an efficient manner if implemented systems are to be effective in real applications. This is particularly relevant to Description Logics, where subsumption reasoning with r ...
Inferring preferred extensions by Pstable semantics
Inferring preferred extensions by Pstable semantics

... into a logic programming in the same line as the metainterpreter proposed by Dung. To find suitable translators for argumentation theory based on logic programming is close related to find suitable codifications of an argumentation framework as logic program. This is because there is a strong relati ...
Assessing Conceptual Similarity to Support Concept Mapping б г д
Assessing Conceptual Similarity to Support Concept Mapping б г д

... Concepts have different importances in concept maps, and the concept map layout often provides useful information for assigning concept weights. For example, a main concept usually appears at the top of each concept map, specifying the main topic. In (Cañas, Leake, & Maguitman 2001) we proposed tha ...
CS 8520: Artificial Intelligence
CS 8520: Artificial Intelligence

... A. It is the science and engineering of making intelligent machines, especially intelligent computer programs. It is related to the similar task of using computers to understand human intelligence, but AI does not have to confine itself to methods that are biologically observable. (John McCarthy, 19 ...
Thesis - CiteSeerX
Thesis - CiteSeerX

... undermine their formal consistency. In addition, certainty factor based expert systems are static – they consist of a set of rules and certainty factors which do not change during the operation of the system. This means that the availability of additional data will not result in fine tuning of the s ...
parsing with flexibility, dynamic strategies, and idioms in mind
parsing with flexibility, dynamic strategies, and idioms in mind

... above; and b) will give limited support to our understanding of those machines. While these statements may be readily endorsed by all those working with an "integrated" or "semantics driven" approach, things ...
CS 8520: Artificial Intelligence
CS 8520: Artificial Intelligence

... A. Intelligence is the computational part of the ability to achieve goals in the world. Varying kinds and degrees of intelligence occur in people, many animals and some machines. (John McCarthy, 1956. http://www.formal.Stanford.EDU/jmc/whatisai ) ...
Chapter 1 ARGUMENTATION THEORY AND DECISION AIDING
Chapter 1 ARGUMENTATION THEORY AND DECISION AIDING

... Analysis have focussed on such issues for a long time, but more on how this “best solution” should be established and less on how a decision maker should be convinced about that (for exceptions on that see [16, 25]). On the other hand, in the field of Artificial Intelligence, argumentation has been ...
AII and Heterogeneous Design with - ICAR
AII and Heterogeneous Design with - ICAR

... content when tree rewriting because not all intelligent functions are required to be mutually informable. Theories are presented by axioms that define them and it is difficult to keep track of what equations not to apply when proving properties. We already have presented the mathematics that allows ...
Part 2 - Simon Fraser University
Part 2 - Simon Fraser University

... – Robustness against failure – Elegance IAT-888 Metacreation ...
University  of  Michigan Jerusalem,  Israel durfee/
University of Michigan Jerusalem, Israel durfee/

... can employ various methods, including iterated dominance and adopting assumptions about the agents and solving for optimal mixed strategies. Different analyses might use different solution concepts, and thus (as seen above) different decisions can be rational in the context of different solution con ...
Lebeltel2000
Lebeltel2000

... where the first equality results from the marginalization rule (equation [E3.10]), the second results from the product rule (equation [E3.6]) and the third corresponds to a second application of the marginalization rule. The denominator appears to be a normalization term. Consequently, by convention ...
AVATAR Modulo Theories
AVATAR Modulo Theories

... Our setting is that of many-sorted first-order predicate logic with equality in clausal form. A signature Σ is a set of predicate and function symbols with associated arities. Terms are of the form f (t1 , . . . , tn ), c or x where f is a function symbol of arity n ≥ 1, t1 , . . . , tn are terms, c ...
questions and answers: reasoning and querying in description logic
questions and answers: reasoning and querying in description logic

... Description Logics (DLs) are a family of formal languages for describing complex structured classes. These languages contain boolean operators and quantification over class attributes, as well as the specification of elements of the classes and their properties. DL knowledge bases (KBs) consist of a ...
pre-print - School of Computer Science, University of Birmingham.
pre-print - School of Computer Science, University of Birmingham.

... different varieties of simulative and non-simulative meta-reasoning carefully, as some varieties of non-simulative reasoning are not that different from some varieties of Simulative Reasoning. The other half of the chapter yokes Simulative Reasoning to a different and rather radical proposal about ...
Automated subject classification of textual web documents
Automated subject classification of textual web documents

... Another  difference  within  the  text  categorization  approach  is  in  the  document  pre-­‐processing  and   indexing  part,  where  documents  are  represented  as  vectors  of  term  weights.  Computing  the  term   weights  can  be   ...
Fuzzy Genetic Algorithms
Fuzzy Genetic Algorithms

... quirements could be simple due to the fact that faster algorithms are better, or more complex because stronger materials are better as long as they are not too heavy (Garg, 2015). The selection means that individuals are selected according to specific selection rules, which are called parents and co ...
JudgeD: A Probabilistic Datalog with Dependencies
JudgeD: A Probabilistic Datalog with Dependencies

... If a new fact is discovered during the search it is only necessary to expand on it if it is not subsumed by an already discovered fact. While datalog has no functions, and thus no functional subsumption, the introduction of descriptive sentences creates a different kind of subsumption. A new fact hf ...
A Short Tutorial on Model
A Short Tutorial on Model

... ii. If ∆ is a minimal set such that SD ∪ {ok(c) | c ∈ COMPS \ ∆} ∪ OBS is consistent, then ∆ is a diagnosis. The minimality of ∆ implies that SD∪{ok(c) | c ∈ COMPS\∆}∪OBS∪{ok(ci )} is inconsistent for any ci ∈ ∆. Thus for all ci ∈ ∆ we have that SD∪{ok(c) | c ∈ COMPS\∆}∪OBS  ¬ok(ci ) and therefore ...
Combining Classifiers: from the creation of ensembles - ICMC
Combining Classifiers: from the creation of ensembles - ICMC

... classification algorithm behaves. Therefore, in practical pattern classification tasks it is difficult to find a good single classifier. ...
ppt
ppt

...  be a successful functioning entity as ‘agent’ in an ‘environment’ ...
Reports on the 2015 AAAI Workshop Series
Reports on the 2015 AAAI Workshop Series

... power available is a valuable resource. Battery power is needed not only to power the engine, but also to run auxiliary systems, such as the climate-control system. Part of the work presented in the workshop has focused on developing an adaptive-advise agent that makes recommendations to the driver ...
Considerations on Belief Revision in an Action Theory
Considerations on Belief Revision in an Action Theory

... It would seem to be a straightforward matter to address belief revision in a transition system framework, by simply combining an account of reasoning about knowledge with an account of belief revision. This in turn could be accomplished by simply specifying a faithful assignment, as in Definition 2, ...
Execution monitoring in robotics: A survey
Execution monitoring in robotics: A survey

... is a general model for crossing any door between two rooms. The main drawback of this method is the lack of robustness, since full observability of the robot’s state is assumed. A similar approach to PLANEX is presented in [18]. Faults are detected by comparing the current state with the model of th ...
Springer CC Volume proposal
Springer CC Volume proposal

... For 2011-2013 Veale was an invited professor of Linguistic Web Science at KAIST, the Korean institute of Advanced Science and Technology. Veale continues to promote Computational Creativity internationally via summer schools and tutorials at relevant conferences (such as at a recent tutorial on meta ...
< 1 ... 3 4 5 6 7 8 9 10 11 ... 135 >

Knowledge representation and reasoning

Knowledge representation and reasoning (KR) is the field of artificial intelligence (AI) dedicated to representing information about the world in a form that a computer system can utilize to solve complex tasks such as diagnosing a medical condition or having a dialog in a natural language. Knowledge representation incorporates findings from psychology about how humans solve problems and represent knowledge in order to design formalisms that will make complex systems easier to design and build. Knowledge representation and reasoning also incorporates findings from logic to automate various kinds of reasoning, such as the application of rules or the relations of sets and subsets.Examples of knowledge representation formalisms include semantic nets, systems architecture, Frames, Rules, and ontologies. Examples of automated reasoning engines include inference engines, theorem provers, and classifiers.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report