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 45
Página 148
... resolution that reduces some of the complexity because it operates on statements that have first been converted to a single canonical form . 5.4 RESOLUTION As we suggested above , it would be useful from a computational point of view if ...
... resolution that reduces some of the complexity because it operates on statements that have first been converted to a single canonical form . 5.4 RESOLUTION As we suggested above , it would be useful from a computational point of view if ...
Página 153
... resolution works , we will first present the resolu- tion procedure for propositional logic . We will then expand it to include predi- cate logic . In propositional logic , the procedure ... RESOLUTION 153 Resolution in Propositional Logic.
... resolution works , we will first present the resolu- tion procedure for propositional logic . We will then expand it to include predi- cate logic . In propositional logic , the procedure ... RESOLUTION 153 Resolution in Propositional Logic.
Página 159
... resolution can be used to prove new things about him . Let's first consider the set of state- ments introduced in Section 5.2 . To use them in resolution proofs , they must be converted to clause form as described in Section 5.4.1 ...
... resolution can be used to prove new things about him . Let's first consider the set of state- ments introduced in Section 5.2 . To use them in resolution proofs , they must be converted to clause form as described in Section 5.4.1 ...
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