Artificial Intelligence, Volumen1McGraw-Hill, 1983 - 436 páginas What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 57
Página 139
... predicate logic , it can still serve as a useful way of representing and manipulating some of the kinds of knowledge that an A.I. sys- tem might need . Let's now explore the use of predicate logic as a way of representing knowledge by ...
... predicate logic , it can still serve as a useful way of representing and manipulating some of the kinds of knowledge that an A.I. sys- tem might need . Let's now explore the use of predicate logic as a way of representing knowledge by ...
Página 158
... predicates they con- tain , combined with an indication of whether or not the predicate is negated . Then , given a particular clause , possible resolvents that contain a complimentary occurrence of one of its predicates can be located ...
... predicates they con- tain , combined with an indication of whether or not the predicate is negated . Then , given a particular clause , possible resolvents that contain a complimentary occurrence of one of its predicates can be located ...
Página 162
... predicates . If the predicate evaluates to F , it can simply be dropped , since adding VF to a disjunction cannot change its truth value . If the predicate evaluates to T , then the generated clause is a tautology and cannot lead to a ...
... predicates . If the predicate evaluates to F , it can simply be dropped , since adding VF to a disjunction cannot change its truth value . If the predicate evaluates to T , then the generated clause is a tautology and cannot lead to a ...
Otras ediciones - Ver todas
Términos y frases comunes
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY Artificial Intelligence backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraints contains database described discussed domain example exploit explore fact frame game tree goal grammar graph heuristic heuristic function important input INTERLISP ISA links John knowledge representation labelings LISP Marcus match methods minimax move MYCIN natural language necessary node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production system PROLOG propositional logic question reasoning representing knowledge rules Schank script search procedure search process Section semantic net sentence shown in Figure simple situation slots solution solve specific stack statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding variety