Concurrent Inference Graphs. Daniel R. Schlegel. Department of Computer Science and Engineering. Problem Summary. Subsumption Inference. L A – A Logic of Arbitrary and Indefinite Objects.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Concurrent Inference Graphs
Daniel R. Schlegel
Department of Computer Science and Engineering
LA – A Logic of Arbitrary and Indefinite Objects
Inference graphs2 in their current form only support propositional logic. We expand it to support LA – A Logic of Arbitrary and Indefinite Objects.3
Note: Much of this is work in progress, advice and criticism are very welcome!
Example (Structure Sharing):
The arbitrary domesticated dog is both loyal and friendly. Notice that only one arbitrary domesticated dog has been created in the graph.
From MGU factorization
Hoder, K., & Voronkov, A. Comparing unification algorithms in first-order theorem proving. In KI 2009: Advances in Artificial Intelligence (pp. 435-443). Springer Berlin Heidelberg, 2009.
Schlegel, D. R. & Shapiro, S. C.Concurrent Reasoning with Inference Graphs. In Proceedings of the Third International IJCAI Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR 2013), 2013, in press.
Shapiro, S. C.A Logic of Arbitrary and Indefinite Objects. In D. Dubois, C. Welty, & M. Williams, Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), AAAI Press, Menlo Park, CA, 2004, 565-575.
Woods, W. A. Understanding subsumption and taxonomy. In Sowa, J., ed., Principles of Semantic Networks. Los Altos, CA: Morgan Kaufmann. 45–94, 1991.
This graph contains the proposition that every arbitrary entity is friends with their arbitrary child. It also contains the wh-question “Who is Dave friends with?” Two i-channels are created from wft1 to wft3, since the friends relation is symmetric. Note that arb1, arb2, qvar1, and Dave are all entities, but that data has been omitted from the graph for readability.
This work has been supported by a Multidisciplinary University Research Initiative (MURI) grant (Number W911NF-09- 1-0392) 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.