Visually Interacting with a Knowledge Base
|
|
|
- Isabel Wright
- 5 years ago
- Views:
Transcription
1 Visually Interacting with a Knowledge Base Using Frames, Logic, and Propositional Graphs With Extended Background Material Daniel R. Schlegel and Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo, The State University of New York Buffalo, New York, USA {drschleg,shapiro}@buffalo.edu D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
2 Outline 1 Introduction 2 The Logic View 3 The Frame View 4 The Propositional Graph View 5 Retrieving Information 6 Collapsing the Graph 7 Geographic KB Example 8 Conclusions D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
3 Introduction SNePS 3 SNePS 3 is the latest member of the SNePS Family of KRR systems. It is still being implemented. The SNePS 3 KB can be thought of as simultaneously being: Logic based, Frame based, and Graph based. We have created a user interface which uses all three: Assertions and queries of a KB are handled using logic or frames. Visualization and inspection is done using propositional graphs. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
4 Styles of Inference Introduction Each view supports a style of inference: Logic-based view Natural Deduction inference Frame-based view Slot-based inference Graph-based view Path-based inference D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
5 SNePS 3 GUI Introduction D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
6 The Logic View KB as set of Logical Expressions The SNePS 3 KB is a set of logical expressions: Atomic terms Individual constants denoting entities in domain including some relations Arbitrary and indefinite terms [Shapiro, KR2004] Functional terms including terms denoting atomic propositions terms denoting non-atomic propositions Use CLIF syntax. Every logical expression is a term. Allows propositions about propositions without leaving First-Order. Internal name of functional terms: wfti [!] for well-formed term. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
7 The Logic View KB as set of Logical Expressions The SNePS 3 KB is a set of logical expressions: Atomic terms Individual constants denoting entities in domain including some relations Arbitrary and indefinite terms [Shapiro, KR2004] Functional terms including terms denoting atomic propositions terms denoting non-atomic propositions Use CLIF syntax. Every logical expression is a term. Allows propositions about propositions without leaving First-Order. Internal name of functional terms: wfti [!] for well-formed term. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
8 The Logic View KB as set of Logical Expressions The SNePS 3 KB is a set of logical expressions: Atomic terms Individual constants denoting entities in domain including some relations Arbitrary and indefinite terms [Shapiro, KR2004] Functional terms including terms denoting atomic propositions terms denoting non-atomic propositions Use CLIF syntax. Every logical expression is a term. Allows propositions about propositions without leaving First-Order. Internal name of functional terms: wfti [!] for well-formed term. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
9 The Logic View KB as set of Logical Expressions The SNePS 3 KB is a set of logical expressions: Atomic terms Individual constants denoting entities in domain including some relations Arbitrary and indefinite terms [Shapiro, KR2004] Functional terms including terms denoting atomic propositions terms denoting non-atomic propositions Use CLIF syntax. Every logical expression is a term. Allows propositions about propositions without leaving First-Order. Internal name of functional terms: wfti [!] for well-formed term. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
10 The Logic View KB as set of Logical Expressions The SNePS 3 KB is a set of logical expressions: Atomic terms Individual constants denoting entities in domain including some relations Arbitrary and indefinite terms [Shapiro, KR2004] Functional terms including terms denoting atomic propositions terms denoting non-atomic propositions Use CLIF syntax. Every logical expression is a term. Allows propositions about propositions without leaving First-Order. Internal name of functional terms: wfti [!] for well-formed term. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
11 The Logic View KB as set of Logical Expressions The SNePS 3 KB is a set of logical expressions: Atomic terms Individual constants denoting entities in domain including some relations Arbitrary and indefinite terms [Shapiro, KR2004] Functional terms including terms denoting atomic propositions terms denoting non-atomic propositions Use CLIF syntax. Every logical expression is a term. Allows propositions about propositions without leaving First-Order. Internal name of functional terms: wfti [!] for well-formed term. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
12 Example Input The Logic View Sufian, a person in Adhamiya, called Ziyad, a person who, according to Ahmed, is in Ramadi, saying My brother sends greetings. Note: wft6 gives meta-information D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
13 The Logic View Non-atomic Propositions (not p) (thnot p) (and p 1,..., p n ) (or p 1,..., p n ) (nand p 1,..., p n ) (nor p 1,..., p n ) (xor p 1,..., p n ) (iff p 1,..., p n ) (thnor p 1,..., p n ) (andor (i j) p 1,..., p n )) (thresh (i j) p 1,..., p n ) (if (setof p 1,..., p n ) (setof q 1,..., q m )) (v=> (setof p 1,..., p n ) (setof q 1,..., q m )) (i=> (setof p 1,..., p n ) (setof q 1,..., q m )) [Shapiro, KR2010] D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
14 The Logic View Natural Deduction Inference Forward-chaining and Backward-chaining Natural Deduction inference implemented but currently only for propositional fragment. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
15 The Logic View Example Forward Natural Deduction Inference : (assert (xor (Isa Pat Man) (Isa Pat Woman) (Isa Pat Robot))) wft4!: (xor (Isa Pat Woman) (Isa Pat Man) (Isa Pat Robot)) : (assert! (Isa Pat Woman)) Since wft4!: (xor (Isa Pat Woman) (Isa Pat Man) (Isa Pat Robot)) and wft2!: (Isa Pat Woman) I infer wft5!: (not (Isa Pat Man)) by Forward chaining. Since wft4!: (xor (Isa Pat Woman) (Isa Pat Man) (Isa Pat Robot)) and wft2!: (Isa Pat Woman) I infer wft6!: (not (Isa Pat Robot)) by Forward chaining. wft6!: (not (Isa Pat Robot)) wft5!: (not (Isa Pat Man)) wft2!: (Isa Pat Woman) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
16 The Logic View Example Natural Deduction Theorem Proving : (ask (if (if (and A B) C) (if A (if B C)))) Let me assume that wft2?: (if (and B A) C) Let me assume that A Let me assume that B Since A and B I infer wft1?: (and B A) by And Introduction. Since wft2?: (if (and B A) C) and wft1?: (and B A) I infer C by Implication Elimination. Since C can be derived after assuming B I infer wft3?: (if B C) by Implication Introduction. Since wft3?: (if B C) can be derived after assuming A I infer wft4?: (if A (if B C)) by Implication Introduction. Since wft4?: (if A (if B C)) can be derived after assuming wft2?: (if (and B A) C) I infer wft5!: (if (if (and B A) C) (if A (if B C))) by Implication Introduction. wft5!: (if (if (and B A) C) (if A (if B C))) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
17 Sorted Logic The Logic View Every term has a sort (semantic type). Sorts form a hierarchy. A sort may have multiple parents. User may introduce new sorts. Initial sort hierarchy (ontology): D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
18 The Logic View The Sort of a Term May be specified at creation. May be inferred from use. Not represented in object language. Object language proposition, (Isa term sort), is inferable from the sort hierarchy. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
19 The Logic View The Sort of a Term May be specified at creation. May be inferred from use. Not represented in object language. Object language proposition, (Isa term sort), is inferable from the sort hierarchy. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
20 The Logic View The Sort of a Term May be specified at creation. May be inferred from use. Not represented in object language. Object language proposition, (Isa term sort), is inferable from the sort hierarchy. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
21 The Logic View The Sort of a Term May be specified at creation. May be inferred from use. Not represented in object language. Object language proposition, (Isa term sort), is inferable from the sort hierarchy. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
22 The Logic View Example Sort-based Inference : (assert (Isa Sufian Person)) wft1!: (Isa Sufian Person) : (list-terms :types t) <atom-category> Person <atom-entity> Sufian <categorization-proposition> wft1!: (Isa Sufian Person) : (ask (Isa Person Category)) I infer wft2!: (Isa Person Category) by Sort-Based inference. wft2!: (Isa Person Category) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
23 The Frame View Caseframes Based on The Case for Case [Fillmore, 1968] and The Berkeley FrameNet Project [Baker, Fillmore, & Lowe, 1998; Ruppenhofer et al., 2010] Frame schematic representation of a situation with a set of participants and conceptual roles. Eliminates syntactic differences. E.g. Sufian called Ziyad. Ziyad was called by Sufian. a call from Sufian to Ziyad We will use caseframe for their frame and use frame for an instantiated caseframe. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
24 The Frame View Components of Caseframes Definition A caseframe has A name a A semantic type (sort) The type of the instances of the caseframe An ordered list of slots a Temporary simplification for GUI. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
25 The Frame View Slots Slots are defined globally independently of the caseframes that use them. Definition A slot has A name A sort for its fillers Minimum and maximum number of fillers Adjustment rule: reduce, expand, none A path... D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
26 The Frame View Examples of Caseframes Example Isa is a caseframe of type Proposition with slots member and class. Example Call is a caseframe of type Proposition with slots Communicator, Addressee, and Communication. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
27 Caseframes available The Frame View The user interface maintains a list of the available caseframes for use. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
28 The Frame View Defining a caseframe in the GUI D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
29 The Frame View Frames vs. Logical Terms A frame is an instance of a caseframe. The logical term (F x 1,..., x n ) is represented by an instance of the caseframe named F whose slots, s 1,..., s n are filled by the representations of x 1,..., x n, respectively. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
30 The Frame View Frames vs. Logical Terms: Example (assert (Call Sufian Ziyad "My brother sends greetings")) creates an instance of the Call caseframe whose Communicator slot contains the filler Sufian, whose Addressee slot contains Ziyad, and whose Communication slot contains "My brother sends greetings". D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
31 Assertions to the KB The Frame View Propositions (frames) can be added to the KB through a graphical interface much like filling in a database table. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
32 Slot-Based Inference The Frame View A frame, F 1, logically entails another, F 2 if F 2 s slots are filled with subsets or supersets of F 1 s according to the adjustment rules of the slots. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
33 The Frame View Example of Slot-based Inference : (assert (Isa (setof Fido Rover Lassie) (setof Dog Pet))) wft1!: (Isa (setof Rover Lassie Fido) (setof Dog Pet)) : (ask (Isa (setof Fido Rover) Dog)) Since wft1!: (Isa (setof Rover Lassie Fido) (setof Dog Pet)) I infer wft2!: (Isa (setof Rover Fido) Dog) by Slot-Based inference. wft2!: (Isa (setof Rover Fido) Dog) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
34 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
35 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
36 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
37 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
38 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
39 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
40 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
41 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
42 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
43 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
44 The Propositional Graph View Propositional Graphs A way of visualizing and traversing the frames. Directed Acyclic Graph (except for some and every arcs) Every term is a node. Individual constants Arbitrary and Indefinite terms Functional terms (frames) Proposition-denoting functional terms Node ID is symbol frame name (wfti [!]) Edges drawn from the node corresponding to the frame, to the nodes corresponding to the slot fillers Edges labeled by slot names D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
45 The Propositional Graph View Example Propositional Graph Sufian, a person in Adhamiya, called Ziyad, a person who, according to Ahmed, is in Ramadi, saying My brother sends greetings. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
46 The Propositional Graph View Some GUI Facilities on Graph Can drag nodes. Can pan and zoom. Implemented in Jung D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
47 The Propositional Graph View Arbitrary and Indefinite Terms (Call (every x (Isa Person x) (LocationOf x Adhamya)) (some y (x) (Isa Person y) (LocationOf y Ramadi)) Greetings) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
48 The Propositional Graph View Path-Based Inference A propositional function node, p 2 is logically entailed by another, p 1 if an arc-node wire from p 2 is implied by an appropriate path descending from p 1. Currently broken in SNePS 3. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
49 Logic-based find Retrieving Information D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
50 Query By Example Retrieving Information Using Frame view: (Find and QBE don t currently do inference.) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
51 Retrieving Information Graphical Result of Query Graphical view of result of find or QBE ( Filtered Graph): D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
52 Retrieving Information Query via the Graph (Inspection) Right click on node. Can: Hide node. Show/Hide frames it is a filler in. Show/Hide slots and fillers. Show either all slots/fillers or none. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
53 Retrieving Information Example Result of Graph Query Right click on Sufian node. Choose to show frames it is a filler in. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
54 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
55 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
56 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
57 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
58 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
59 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
60 Collapsing the Graph Graph View as Visualization Visualized graph is for human comprehension. Visualized graph need not be isomorphic to implementation of KB. Usefulness of wft nodes: Functional term with more than two arguments (slots). Functional term with more than one filler in a slot. Functional term shown as argument of another (filler in a slot). Can show a binary relation with no arc coming into it as a labeled arc ( collapsed arc ). D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
61 Collapsing the Graph Visualizing a Collapsed Arc Slots in a frame are ordered. Order of slots = order of arguments of functional term. Draw collapsed arc from first argument to second argument. Name of caseframe = function symbol. Label collapsed arc with function symbol. Different style of arrow head so user knows it s a collapsed arc. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
62 Collapsing the Graph Visualizing a Collapsed Arc Slots in a frame are ordered. Order of slots = order of arguments of functional term. Draw collapsed arc from first argument to second argument. Name of caseframe = function symbol. Label collapsed arc with function symbol. Different style of arrow head so user knows it s a collapsed arc. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
63 Collapsing the Graph Visualizing a Collapsed Arc Slots in a frame are ordered. Order of slots = order of arguments of functional term. Draw collapsed arc from first argument to second argument. Name of caseframe = function symbol. Label collapsed arc with function symbol. Different style of arrow head so user knows it s a collapsed arc. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
64 Collapsing the Graph Visualizing a Collapsed Arc Slots in a frame are ordered. Order of slots = order of arguments of functional term. Draw collapsed arc from first argument to second argument. Name of caseframe = function symbol. Label collapsed arc with function symbol. Different style of arrow head so user knows it s a collapsed arc. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
65 Collapsing the Graph Visualizing a Collapsed Arc Slots in a frame are ordered. Order of slots = order of arguments of functional term. Draw collapsed arc from first argument to second argument. Name of caseframe = function symbol. Label collapsed arc with function symbol. Different style of arrow head so user knows it s a collapsed arc. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
66 Collapsing the Graph Visualizing a Collapsed Arc Slots in a frame are ordered. Order of slots = order of arguments of functional term. Draw collapsed arc from first argument to second argument. Name of caseframe = function symbol. Label collapsed arc with function symbol. Different style of arrow head so user knows it s a collapsed arc. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
67 Collapsing the Graph Example of Collapsed Graph: Before The uncollapsed version of Suifian calling Ziyad example: D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
68 Collapsing the Graph Example of Collapsed Graph: After The collapsed version of Suifian calling Ziyad example: D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
69 Geographic KB Example NGA GEOnet Names Server KB 2,075 terms representing place names and information about them. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
70 Filtered Graph Geographic KB Example Filtered to show only instances of (Isa?x Country) D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
71 Geographic KB Example Collapsed Filtered Graph D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
72 Conclusions Evaluation of Graph Visualization These techniques have been used successfully on graphs containing several thousand nodes. The techniques should scale much further; the limitation may be the JUNG graphing system. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
73 Conclusions Conclusions Can view a Knowledge Base as A set of logical expressions A set of frames A propositional graph Each view provides a style of inference. A GUI can supply all views, use whichever view is most appropriate for the purpose. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
74 Acknowledgements Conclusions Multidisciplinary University Research Initiative (MURI) Grant (Number W911NF ) for Unified Research on Network-based Hard/Soft Information Fusion Issued by the US Army Research Office (ARO) under the program management of Dr. John Lavery. D. R. Schlegel and S. C. Shapiro (UB) GKR / 45
Semantic Types (Sorts) in SNePS 3 Presentation to SNeRG March 28, 2008
Semantic Types (Sorts) in SNePS 3 Presentation to SNeRG March 28, 2008 Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Knowledge Representation
Knowledge Representation References Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Outline
Inference Graphs: Combining Natural Deduction and Subsumption Inference in a Concurrent Reasoner
Proc. AAAI-15 1 Inference Graphs: Combining Natural Deduction and Subsumption Inference in a Concurrent Reasoner Daniel R. Schlegel a and Stuart C. Shapiro b a Department of Biomedical Informatics b Department
COMP4418 Knowledge Representation and Reasoning
COMP4418 Knowledge Representation and Reasoning Week 3 Practical Reasoning David Rajaratnam Click to edit Present s Name Practical Reasoning - My Interests Cognitive Robotics. Connect high level cognition
Semantic Nets, Frames, World Representation. CS W February, 2004
Semantic Nets, Frames, World Representation CS W4701 24 February, 2004 Knowledge Representation as a medium for human expression An intelligent system must have KRs that can be interpreted by humans. We
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Module 8. Other representation formalisms. Version 2 CSE IIT, Kharagpur
Module 8 Other representation formalisms 8.1 Instructional Objective The students should understand the syntax and semantic of semantic networks Students should learn about different constructs and relations
Object-based representation. Objects
Object-based representation Luger, Part III, 6.0, 6.1, 6.2.2-6.2.4, 6.4 (skim) Objects Two basic forms of Structured Objects Semantic Nets Frames Semantic Nets (Associative Nets) Components Nodes - represent
INF5390 Kunstig intelligens. First-Order Logic. Roar Fjellheim
INF5390 Kunstig intelligens First-Order Logic Roar Fjellheim Outline Logical commitments First-order logic First-order inference Resolution rule Reasoning systems Summary Extracts from AIMA Chapter 8:
Knowledge representation Semantic networks and frames
Knowledge representation Semantic networks and frames CmSc310 Artificial Intelligence 1. Introduction: What is knowledge? The science that studies various issues about knowledge is called epistemology.
Lecture 17 of 41. Clausal (Conjunctive Normal) Form and Resolution Techniques
Lecture 17 of 41 Clausal (Conjunctive Normal) Form and Resolution Techniques Wednesday, 29 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Chapter 9,
l A family of logic based KR formalisms l Distinguished by: l Decidable fragments of FOL l Closely related to Propositional Modal & Dynamic Logics
What Are Description Logics? Description Logics l A family of logic based KR formalisms Descendants of semantic networks and KL-ONE Describe domain in terms of concepts (classes), roles (relationships)
CS 343: Artificial Intelligence
CS 343: Artificial Intelligence Bayes Nets: Independence Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/27
CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter 2.1-2.7 p. 1/27 CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer
Part I Logic programming paradigm
Part I Logic programming paradigm 1 Logic programming and pure Prolog 1.1 Introduction 3 1.2 Syntax 4 1.3 The meaning of a program 7 1.4 Computing with equations 9 1.5 Prolog: the first steps 15 1.6 Two
Overview. Introduction to Database Design. ER Model. Database Design
Introduction to Database Design UVic C SC 370 Dr. Daniel M. German Department of Computer Science Overview What are the steps in designing a database? What is the entity-relationship (ER) model? How does
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
So many Logics, so little time
So many Logics, so little time One classical way to organize them is by tractability vs. expressivity. Description Logics (DLs) are basically subsets of FO logic, located in a 'sweet spot' which provides
ICOM Intelligent COnceptual Modelling Tool version User Manual. franconi/icom/
ICOM Intelligent COnceptual Modelling Tool version 3.0.0 User Manual http://www.inf.unibz.it/ franconi/icom/ March 31, 2009 1 Contents 1 Overview 3 2 Installing and Launching ICOM 4 3 ICOM general workspace
Logic: TD as search, Datalog (variables)
Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from Chpt 12) June, 8, 2017 CPSC 322, Lecture 23 Slide 1 Lecture Overview Recap Top
Knowledge Representation Techniques
Knowledge Engineering Course Department of Electronics - Politecnico di Milano http://www.dei.polimi.it/people/bonarini Academic Year 2010-2011 Declarations or procedures... Declarative description Set
Semantics and Pragmatics of NLP Propositional Logic, Predicates and Functions
, Semantics and Pragmatics of NLP, and s Alex Ewan School of Informatics University of Edinburgh 10 January 2008 , 1 2 3 4 Why Bother?, Aim: 1 To associate NL expressions with semantic representations;
Guided Tour: Intelligent Conceptual Modelling in EER and UML-like class diagrams with icom compared to ORM2
Guided Tour: Intelligent Conceptual Modelling in EER and UML-like class diagrams with icom compared to ORM2 Abstract. In this guided tour we illustrate the advantages of intelligent conceptual modelling,
Module 8. Other representation formalisms. Version 2 CSE IIT, Kharagpur
Module 8 Other representation formalisms Lesson 21 Frames II Slots as Objects How can we to represent the following properties in frames? Attributes such as weight, age be attached and make sense. Constraints
Mining XML Functional Dependencies through Formal Concept Analysis
Mining XML Functional Dependencies through Formal Concept Analysis Viorica Varga May 6, 2010 Outline Definitions for XML Functional Dependencies Introduction to FCA FCA tool to detect XML FDs Finding XML
logic importance logic importance (2) logic importance (3) specializations of logic Horn logic specializations of logic RDF and OWL
logic importance - high-level language for expressing knowledge - high expressive power - well-understood formal semantics - precise notion of logical consequence - systems that can automatically derive
On the Scalability of Description Logic Instance Retrieval
On the Scalability of Description Logic Instance Retrieval V. Haarslev 1, R. Moeller 2, M. Wessel 2 1 Concordia University, Montreal 2 Hamburg University of Technology (TUHH) 1 Supported by EU Project
CSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD
Recap. Growth rates: Arrange the following functions in ascending order of growth rate: n 2 log n n log n 2 log n n/ log n n n Introduction Algorithm: A step-by-step way of solving a problem. Design of
Consistency and Set Intersection
Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study
COMP219: Artificial Intelligence. Lecture 14: Knowledge Representation
COMP219: Artificial Intelligence Lecture 14: Knowledge Representation 1 Overview Last time Game playing Minimax decisions Alpha-beta pruning Today Introduce the need for explicit knowledge representation
Database Design. ER Model. Overview. Introduction to Database Design. UVic C SC 370. Database design can be divided in six major steps:
Database Design Database design can be divided in six major steps: Requirements analysis Conceptual Database design (mostly done using the ER model) Logical Database design Schema refinement Physical Database
CMPT 354 Database Systems I
CMPT 354 Database Systems I Chapter 2 Entity Relationship Data Modeling Data models A data model is the specifications for designing data organization in a system. Specify database schema using a data
Notes for Chapter 12 Logic Programming. The AI War Basic Concepts of Logic Programming Prolog Review questions
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions The AI War How machines should learn: inductive or deductive? Deductive: Expert => rules =>
Database Applications (15-415)
Database Applications (15-415) The Entity Relationship Model Lecture 2, January 15, 2014 Mohammad Hammoud Today Last Session: Course overview and a brief introduction on databases and database systems
OpenCyc Knowledge Base
Advanced Topics A bluffer s guide to Cyc-style KBs Dumping sketch knowledge to files Extending the knowledge base Making queries interactively A KQML API for connecting CogSketch to other software OpenCyc
Semantic Nets and Frames SEEM
Semantic Nets and Frames SEEM 5750 1 Semantic Nets A semantic network a classic AI representation technique used for propositional information a propositional net A proposition a statement that is either
Propositional Logic Formal Syntax and Semantics. Computability and Logic
Propositional Logic Formal Syntax and Semantics Computability and Logic Syntax and Semantics Syntax: The study of how expressions are structured (think: grammar) Semantics: The study of the relationship
CSE 473 Lecture 12 Chapter 8. First-Order Logic. CSE AI faculty
CSE 473 Lecture 12 Chapter 8 First-Order Logic CSE AI faculty What s on our menu today? First-Order Logic Definitions Universal and Existential Quantifiers Skolemization Unification 2 Propositional vs.
Pedigree Management and Assessment Framework (PMAF) Demonstration
Pedigree Management and Assessment Framework (PMAF) Demonstration Kenneth A. McVearry ATC-NY, Cornell Business & Technology Park, 33 Thornwood Drive, Suite 500, Ithaca, NY 14850 kmcvearry@atcorp.com Abstract.
SILVACO. An Intuitive Front-End to Effective and Efficient Schematic Capture Design INSIDE. Introduction. Concepts of Scholar Schematic Capture
TCAD Driven CAD A Journal for CAD/CAE Engineers Introduction In our previous publication ("Scholar: An Enhanced Multi-Platform Schematic Capture", Simulation Standard, Vol.10, Number 9, September 1999)
SAS Infrastructure for Risk Management 3.4: User s Guide
SAS Infrastructure for Risk Management 3.4: User s Guide SAS Documentation March 2, 2018 The correct bibliographic citation for this manual is as follows: SAS Institute Inc. 2017. SAS Infrastructure for
Knowledge Representation. CS 486/686: Introduction to Artificial Intelligence
Knowledge Representation CS 486/686: Introduction to Artificial Intelligence 1 Outline Knowledge-based agents Logics in general Propositional Logic& Reasoning First Order Logic 2 Introduction So far we
Help Contents. Creating a Query - Synopsis
Help Contents Creating a Query - Synopsis...1 Phase 1: How to Begin a New Query...2 Phase 2: Choosing My Data Source...3 Phase 3: Choosing My Data Fields...4 Choosing My Data Fields - Selecting All Fields...4
Basic Structural Modeling. Copyright Joey Paquet,
Basic Structural Modeling Copyright Joey Paquet, 2000 1 Part I Classes Copyright Joey Paquet, 2000 2 Classes Description of a set of objects sharing the same attributes, operations and semantics Abstraction
Linear Time Unit Propagation, Horn-SAT and 2-SAT
Notes on Satisfiability-Based Problem Solving Linear Time Unit Propagation, Horn-SAT and 2-SAT David Mitchell mitchell@cs.sfu.ca September 25, 2013 This is a preliminary draft of these notes. Please do
(Refer Slide Time 6:48)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 8 Karnaugh Map Minimization using Maxterms We have been taking about
Logical reconstruction of RDF and ontology languages
Logical reconstruction of RDF and ontology languages Jos de Bruijn 1, Enrico Franconi 2, and Sergio Tessaris 2 1 Digital Enterprise Research Institute, University of Innsbruck, Austria jos.debruijn@deri.org
Foundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution
Foundations of AI 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 09/1 Contents Motivation
Semantic reasoning for dynamic knowledge bases. Lionel Médini M2IA Knowledge Dynamics 2018
Semantic reasoning for dynamic knowledge bases Lionel Médini M2IA Knowledge Dynamics 2018 1 Outline Summary Logics Semantic Web Languages Reasoning Web-based reasoning techniques Reasoning using SemWeb
Chapter 11 Object and Object- Relational Databases
Chapter 11 Object and Object- Relational Databases Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11 Outline Overview of Object Database Concepts Object-Relational
Introduction to MS Access queries
Introduction to MS Access queries Topics Covered Brief introduction to MS Access query capabilities BSAD 141 Dave Novak Introduction to Access provides powerful query capabilities that allow you to do
Towards a relation ontology for the Semantic Web
Towards a relation ontology for the Semantic Web Dagobert Soergel With the help of Joseph Easterly Department of Library and Information Studies Graduate School of Education University at Buffalo Relations
Boolean Representations and Combinatorial Equivalence
Chapter 2 Boolean Representations and Combinatorial Equivalence This chapter introduces different representations of Boolean functions. It then discusses the applications of these representations for proving
X-KIF New Knowledge Modeling Language
Proceedings of I-MEDIA 07 and I-SEMANTICS 07 Graz, Austria, September 5-7, 2007 X-KIF New Knowledge Modeling Language Michal Ševčenko (Czech Technical University in Prague sevcenko@vc.cvut.cz) Abstract:
F15: Formalizing definiteness
F15: Formalizing definiteness Ling 331 / 731 Spring 2016 We saw how the truth-conditional meaning of definiteness involves reference and a presupposition of uniqueness We know the syntactic structure of
Question about Final Exam. CS 416 Artificial Intelligence. What do we like about propositional logic? First-order logic
Page 1 Question about Final Exam CS 416 Artificial Intelligence I will have a date for you by Tuesday of next week. Lecture 13 First-Order Logic Chapter 8 First-order logic We saw how propositional logic
PdOd Kev Events I Re-world war I1 rwa
I PdOd Kev Events I Re-world war I rwa LECTURE: Knowledge Representation Overview 0 'Qpes of knowledge: objects, events, meta-knowledge, etc. 0 Characteristics of representation: expressive adequacy vs.
Chapter 3. Gate-Level Minimization. Outlines
Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level
Working with Analytical Objects. Version: 16.0
Working with Analytical Objects Version: 16.0 Copyright 2017 Intellicus Technologies This document and its content is copyrighted material of Intellicus Technologies. The content may not be copied or derived
Alwin Tareen <tareen> October 11, 2010
Project 1 An Application of Ontological Concepts, Categories and Relationships on a Knowledge Base of Common Household Items and Analysis with SNARK CSE 563: Knowledge Representation & Reasoning Alwin
Integration of SMT Solvers with ITPs There and Back Again
Integration of SMT Solvers with ITPs There and Back Again Sascha Böhme and University of Sheffield 7 May 2010 1 2 Features: SMT-LIB vs. Yices Translation Techniques Caveats 3 4 Motivation Motivation System
LOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
Java and the Future of SNePS SneRG Technical Note 31
Java and the Future of SNePS SneRG Technical Note 31 Anthony Petre Department of Computer Science and Engineering State University of New York at Buffalo 226 Bell Hall Buffalo, NY 14260-2000 November 16,
THE USE OF CONCEPTUAL MODELS DURING THE DESIGN OF NEW TELECOMMUNICATION SERVICES. Ali Roshannejad, Armin Eberlein
THE USE OF CONCEPTUAL MODELS DURING THE DESIGN OF NEW TELECOMMUNICATION SERVICES Ali Roshannejad, Armin Eberlein Electrical and Computer Engineering Department University of Calgary Tel: (403) 220-5002
Introduction to Database Design
Introduction to Database Design UVic C SC 370 Daniel M German Introduction to Database Design (1.2.0) CSC 370 4/5/2005 14:52 p.1/33 Overview What are the steps in designing a database? What is the entity-relationship
ARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-7) LOGICAL AGENTS Outline Agent Case (Wumpus world) Knowledge-Representation Logic in general
What is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
Introduction Accessing MICS Compiler Learning MICS Compiler CHAPTER 1: Searching for Data Surveys Indicators...
Acknowledgement MICS Compiler is a web application that has been developed by UNICEF to provide access to Multiple Indicator Cluster Survey data. The system is built on DevInfo technology. 3 Contents Introduction...
OWL 2 Profiles. An Introduction to Lightweight Ontology Languages. Markus Krötzsch University of Oxford. Reasoning Web 2012
University of Oxford Department of Computer Science OWL 2 Profiles An Introduction to Lightweight Ontology Languages Markus Krötzsch University of Oxford Reasoning Web 2012 Remark for the Online Version
Logic Programming and Resolution Lecture notes for INF3170/4171
Logic Programming and Resolution Lecture notes for INF3170/4171 Leif Harald Karlsen Autumn 2015 1 Introduction This note will explain the connection between logic and computer programming using Horn Clauses
Formal editing: jedit-mmt. Narrative editing: LaTeX-MMT. Browsing: MMT web server. Building: MMT scripting language. The MMT API: A Generic MKM System
The MMT API: A Generic MKM System Florian Rabe MMT is foundation-independent: 1. Developer defines new logic 2. MMT yields complete MKM system for it MMT is application-independent: No single MMT application
358 cardinality 18, 55-57, 62, 65, 71, 75-76, 85, 87, 99, 122, 129, , 140, 257, , , 295, categorization 18, 26, 56, 71, 7
4GL 6 access path 8, 24, 35, 38, 88, 99-110, 114, 170, 176, 199, 203-204, 208 active class 270, 317, 323-324, 326, 337 database 315, 321 generalization 322-324 rule 317, 320-321 ADABAS 16 aggregation 18,
Towards a Semantic Web Modeling Language
Towards a Semantic Web Modeling Language Draft Christoph Wernhard Persist AG Rheinstr. 7c 14513 Teltow Tel: 03328/3477-0 wernhard@persistag.com May 25, 2000 1 Introduction The Semantic Web [2] requires
Foundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 12 By Dr. Dalia M. Gil, Ph.D. Trees Tree are useful in computer science, where they are employed in a wide range of algorithms. They are used to construct efficient
CS 4604: Introduction to Database Management Systems. B. Aditya Prakash Lecture #5: Entity/Relational Models---Part 1
CS 4604: Introduction to Database Management Systems B. Aditya Prakash Lecture #5: Entity/Relational Models---Part 1 E/R: NOT IN BOOK! IMPORTANT: Follow only lecture slides for this topic! Differences
SATURN Update. DAML PI Meeting Dr. A. Joseph Rockmore 25 May 2004
SATURN Update DAML PI Meeting Dr. A. Joseph Rockmore 25 May 2004 SATURN: Needs and Challenges [1 of 2]! SATURN = semantic access to time-ordered url s and related information! Objective: easier and more
Formal Systems and their Applications
Formal Systems and their Applications Dave Clarke (Dave.Clarke@cs.kuleuven.be) Acknowledgment: these slides are based in part on slides from Benjamin Pierce and Frank Piessens 1 Course Overview Introduction
Introduction to Prolog
Introduction to Prolog David Woods dwoods@scss.tcd.ie Week 3 - HT Declarative Logic The Prolog programming language is, at its theoretical core, a declarative language. This is unlike more commonly used
Graph Databases. Graph Databases. May 2015 Alberto Abelló & Oscar Romero
Graph Databases 1 Knowledge Objectives 1. Describe what a graph database is 2. Explain the basics of the graph data model 3. Enumerate the best use cases for graph databases 4. Name two pros and cons of
COMP Instructor: Dimitris Papadias WWW page:
COMP 5311 Instructor: Dimitris Papadias WWW page: http://www.cse.ust.hk/~dimitris/5311/5311.html Textbook Database System Concepts, A. Silberschatz, H. Korth, and S. Sudarshan. Reference Database Management
Handling time in RDF
Time in RDF p. 1/15 Handling time in RDF Claudio Gutierrez (Joint work with C. Hurtado and A. Vaisman) Department of Computer Science Universidad de Chile UPM, Madrid, January 2009 Time in RDF p. 2/15
Labeled graph homomorphism and first order logic inference
ECI 2013 Day 2 Labeled graph homomorphism and first order logic inference Madalina Croitoru University of Montpellier 2, France croitoru@lirmm.fr What is Knowledge Representation? Semantic Web Motivation
Knowledge Engineering with Semantic Web Technologies
This file is licensed under the Creative Commons Attribution-NonCommercial 3.0 (CC BY-NC 3.0) Knowledge Engineering with Semantic Web Technologies Lecture 3: Ontologies and Logic 01- Ontologies Basics
Context-Free Grammars
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 3, 2012 (CFGs) A CFG is an ordered quadruple T, N, D, P where a. T is a finite set called the terminals; b. N is a
Set 7: Predicate logic Chapter 8 R&N. ICS 271 Fall 2015
Set 7: Predicate logic Chapter 8 R&N ICS 271 Fall 2015 Outline New ontology objects, relations, properties, functions New Syntax Constants, predicates, properties, functions New semantics meaning of new
The Discrete Event Calculus for Games and Other (Soft) Real Time Systems
The Discrete Event Calculus for Games and Other (Soft) Real Time Systems Matthew Fuchs, PhD Paideia Computing Corp mattfuchs@paideiacomputing.com Outline Movie The target DEC explained DEC as a programming
1. Define admissibility and suggest an admissible heuristic functions for the Rubik s cube. (half-twist is counted as a single move).
1. Define admissibility and suggest an admissible heuristic functions for the Rubik s cube. (half-twist is counted as a single move). (5p) 2. Prove that A* never terminates with the suboptimal goal G 2
Prepared by: Acadia Institute for Teaching and Technology Acadia University, Wolfville, NS, Canada, B0P 1X0 Tel. (902) , Fax (902)
Prepared by: Acadia Institute for Teaching and Technology Acadia University, Wolfville, NS, Canada, B0P X0 Tel. (90) 585-747, Fax (90) 585-76 For Educational use only This manual may be used and copied
Runtime Checking for Program Verification Systems
Runtime Checking for Program Verification Systems Karen Zee, Viktor Kuncak, and Martin Rinard MIT CSAIL Tuesday, March 13, 2007 Workshop on Runtime Verification 1 Background Jahob program verification
Semantic Web Systems Web Services Part 2 Jacques Fleuriot School of Informatics
Semantic Web Systems Web Services Part 2 Jacques Fleuriot School of Informatics 16 th March 2015 In the previous lecture l Web Services (WS) can be thought of as Remote Procedure Calls. l Messages from
Introduction to Computer Architecture
Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of
Introduction to Database Design
Introduction to Database Design UVic C SC 370, Fall 2002 Daniel M. German Department of Computer Science University of Victoria 2 1 Introduction to Database Design CSC 370 dmgerman@uvic.ca Overview What
Lecture 20 : Trees DRAFT
CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,
Business-Driven Software Engineering Lecture 5 Business Process Model and Notation
Business-Driven Software Engineering Lecture 5 Business Process Model and Notation Jochen Küster jku@zurich.ibm.com Agenda BPMN Introduction BPMN Overview BPMN Advanced Concepts Introduction to Syntax
Logic as a framework for NL semantics. Outline. Syntax of FOL [1] Semantic Theory Type Theory
![Logic as a framework for NL semantics. Outline. Syntax of FOL [1] Semantic Theory Type Theory](/thumbs/79/79338002.jpg "Logic as a framework for NL semantics. Outline. Syntax of FOL [1] Semantic Theory Type Theory")
Logic as a framework for NL semantics Semantic Theory Type Theory Manfred Pinkal Stefan Thater Summer 2007 Approximate NL meaning as truth conditions. Logic supports precise, consistent and controlled
FIBO Metadata in Ontology Mapping
FIBO Metadata in Ontology Mapping For Open Ontology Repository OOR Metadata Workshop VIII 02 July 2013 Copyright 2010 EDM Council Inc. 1 Overview The Financial Industry Business Ontology Introduction FIBO
Graph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
Description Logics as Ontology Languages for Semantic Webs
Description Logics as Ontology Languages for Semantic Webs Franz Baader, Ian Horrocks, and Ulrike Sattler Presented by:- Somya Gupta(10305011) Akshat Malu (10305012) Swapnil Ghuge (10305907) Presentation
Propositional Calculus. Math Foundations of Computer Science
Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to