ECAI 92: 10th European Conference on Artificial Intelligence, August 3-7, 1992, Vienna, Austria : ProceedingsBernd Neumann |
From inside the book
Results 1-3 of 89
Page 67
... defined as follows : Definition : Let O , P be two M - objects , α e locc ( O ) , ẞ € locc ( P ) and σ be a substitution . The pair ( α , ẞ ) is called a resolution task of O and P wrt . σ iff σ ( O | α ) = σ ( P | B ) c holds . Let Pẞ ...
... defined as follows : Definition : Let O , P be two M - objects , α e locc ( O ) , ẞ € locc ( P ) and σ be a substitution . The pair ( α , ẞ ) is called a resolution task of O and P wrt . σ iff σ ( O | α ) = σ ( P | B ) c holds . Let Pẞ ...
Page 645
... defined in MRG . MRG features a definition mechanism through the construct deftac . deftac introduces new tactic identifiers . It supports definitions of recursive tactics . In example 3.1 we show a simple defined tactic . Examples of ...
... defined in MRG . MRG features a definition mechanism through the construct deftac . deftac introduces new tactic identifiers . It supports definitions of recursive tactics . In example 3.1 we show a simple defined tactic . Examples of ...
Page 695
... Definition 2.1 : Let f be a mapping defined on QS . The mapping f is called a fixed - point mapping if there exists x in QS , such that f ( x ) = x . Such element x is called a fixed - point of f The set of the fixed - points of mapping ...
... Definition 2.1 : Let f be a mapping defined on QS . The mapping f is called a fixed - point mapping if there exists x in QS , such that f ( x ) = x . Such element x is called a fixed - point of f The set of the fixed - points of mapping ...
Common terms and phrases
10th European Conference abductive Abstract action agents algorithm application approach architecture Artificial Intelligence Edited assumptions atoms belief belief revision blackboard classical clauses CLP(R complex components Computer concept Conference on Artificial connectionist consider consistent constraints corresponding deduction default logic default theory defined definition denote derived described domain domain theory ECAI 92 evaluation event event calculus example Expert Systems extension formal formula function given goal heuristic Horn clauses hypotheses inconsistent induction inference input interpretation knowledge base knowledge representation learning lexical literals logic pro logic programming Machine Learning method minimal modal logic Neumann node nonmonotonic objects operator possible predicate problem solving Proc proof propositional reactive planning reasoning References relation representation represented rules satisfied semantics solution specific stable model strategy structure subset syntactic task temporal theorem tion tree Truth Maintenance System variables