Abstract
We present textual logic (TL), a novel approach that enables rapid semi-automatic acquisition of rich logical knowledge from text. The resulting axioms are expressed as defeasible higher-order logic formulas in Rulelog, a novel extended form of declarative logic programs. A key element of TL is textual terminology, a phrasal style of knowledge in which words/word-senses are used directly as logical constants. Another key element of TL is a method for rapid interactive disambiguation as part of logic-based text interpretation. Existential quantifiers are frequently required, and we describe Rulelog’s approach to making existential knowledge be defeasible. We describe results from a pilot experiment that represented the knowledge from several thousand English sentences in the domain of college-level cell biology, for purposes of question-answering.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chen, W., Kifer, M., Warren, D.: HiLog: A foundation for higher-order logic programming. Journal of Logic Programming 15(3), 187–230 (1993)
Cyc: Cyc (2013) (project begun in approx. 1984), http://www.cyc.com
Flora-2: Flora-2 (2013) (project begun in approx. 2000), http://flora.sourceforge.net
Grosof, B., Andersen, C., Dean, M., Kifer, M.: Omni-directional Hyper Logic Programs in SILK and RIF. In: Proc. RuleML 2010, the 4th Intl. Web Rule Symp (Demonstration and Poster) (2010)
Grosof, B., Burstein, M., Dean, M., Andersen, C., Benyo, B., Ferguson, W., Inclezan, D., Shapiro, R.: A SILK Graphical UI for Defeasible Reasoning, with a Biology Causal Process Example. In: Proc. RuleML 2010, the 4th Intl. Web Rule Symp. (Demonstration and Poster) (2010)
Grosof, B., Swift, T.: Radial Restraint: A Semantically Clean Approach to Bounded Rationality for Logic Programs. In: Proc. AAAI 2013, the 27th AAAI Conf. on Artificial Intelligence (July 2013)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1984)
RuleML: Rule Markup and Modeling Initiative (2013) (project begun in approx. 2000), http://www.ruleml.org
SILK: SILK: Semantic Inferencing on Large Knowledge (2013) (project begun in 2008), http://silk.semwebcentral.org
Swift, T., Warren, D.S.: XSB: Extending Prolog with Tabled Logic Programming. TPLP 12, 157–187 (2012)
Wan, H., Grosof, B., Kifer, M., Fodor, P., Liang, S.: Logic Programming with Defaults and Argumentation Theories. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 432–448. Springer, Heidelberg (2009)
XSB: XSB (2013) (project begun in approx. 1993), http://xsb.sourceforge.net
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grosof, B.N. (2013). Rapid Text-Based Authoring of Defeasible Higher-Order Logic Formulas, via Textual Logic and Rulelog. In: Morgenstern, L., Stefaneas, P., LĂ©vy, F., Wyner, A., Paschke, A. (eds) Theory, Practice, and Applications of Rules on the Web. RuleML 2013. Lecture Notes in Computer Science, vol 8035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39617-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-39617-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39616-8
Online ISBN: 978-3-642-39617-5
eBook Packages: Computer ScienceComputer Science (R0)