75,190 Hits in 2.6 sec

Named Graphs for Semantic Representation

Richard Crouch, Aikaterini-Lida Kalouli
2018 Proceedings of the Seventh Joint Conference on Lexical and Computational Semantics  
Moving from graphs to named graphs leads to representations that stand some chance of having sufficient expressive power. Named F L 0 graphs are of particular interest.  ...  A position paper arguing that purely graphical representations for natural language semantics lack a fundamental degree of expressiveness, and cannot deal with even basic Boolean operations like negation  ...  We are grateful to Tagyoung Chung and Valeria de Paiva for helpful comments on presentation, though they should not be held responsible for the views expressed.  ... 
doi:10.18653/v1/s18-2013 dblp:conf/starsem/CrouchK18 fatcat:iefx6tszbnc4heu4xoyupj676y

Syntax, semantics, and pragmatics of contexts [chapter]

John F. Sowa
1995 Lecture Notes in Computer Science  
In logic, the first representation of context as a formal object was by the philosopher C. S.  ...  These two informal senses suggest intuitive criteria for distinguishing the various functions of contexts: Syntax.  ...  For dyadic relations, the arrow pointing towards the circle is the first argument, and the arrow pointing away is the second argument.  ... 
doi:10.1007/3-540-60161-9_25 fatcat:3f2naoq55vfyljo6zgahtcjsxm

Page 699 of The Philosophical Review Vol. 56, Issue 6 [page]

1947 The Philosophical Review  
In the section on consciousness and introspection, for example (one of the most be- wildering pieces of exposition in the book), the concluding para- graph (p. 227) begins with the quotation of two passages  ...  In stating how logic arrives at its principles (p. 86), Mr.  ... 

Considering Carneades as a Framework for Informal Logic: A Reply to Walton and Gordon

Marcin Selinger, Marcin Koszowy
2016 Informal Logic  
The paper offers a critical analysis of the research program for formalizing informal logic proposed by Douglas Walton and Thomas Gordon (forthcoming).  ...  Since their proposal is based on employing the Carneades Argumentation System (CAS), this paper aims at answering two questions: what are main benefits of applying CAS as means for formalizing informal  ...  Acknowledgements: We would like to thank Douglas Walton and Thomas Gordon for their helpful remarks and receptivity to our criticism.  ... 
doi:10.22329/il.v36i2.4423 fatcat:ibymyuzfdzfmfhz4f2d2mdpmk4

The Carneades model of argument and burden of proof

Thomas F. Gordon, Henry Prakken, Douglas Walton
2007 Artificial Intelligence  
Our approach allows the burden of proof for a premise to be assigned to a different party than the one who has the burden of proving the conclusion of the argument, and also to change the burden of proof  ...  We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation.  ...  Doug Walton was supported by a grant (410-2005-0398) from the Social Sciences and Humanities Research Council of Canada for a project on Dialogue Systems for Argumentation in Artificial Intelligence and  ... 
doi:10.1016/j.artint.2007.04.010 fatcat:bynufnquxzab5lfraqj6pvdnee

Conceptual graphs and first-order logic [chapter]

Michel Wermelinger
1995 Lecture Notes in Computer Science  
De ne an algorithm to translate conceptual graphs into formulas of L. 3. De ne inference rules and logical axioms for conceptual graphs. 4.  ...  On page 142 it is claimed that \any formula in rst-order logic can be expressed with simply nested contexts and lines of identity", and Theorem 4.4.7 on page 173 states that the inference rules for conceptual  ...  As for logical axioms, Sowa only uses the empty set of graphs.  ... 
doi:10.1007/3-540-60161-9_47 fatcat:qur74pdisffangpmdwbdxug4vu

Chapter 5 Conceptual Graphs [chapter]

John F. Sowa
2008 Foundations of Artificial Intelligence  
A conceptual graph (CG) is a graph representation for logic based on the semantic networks of artificial intelligence and the existential graphs of Charles Sanders Peirce.  ...  The semantics of the core and extended CGs is defined by a formal mapping to and from the ISO standard for Common Logic, but the research CGs are defined by a variety of formal and informal extensions.  ...  An arc pointing toward a circle marks the first argument of the relation, and an arc pointing away from a circle marks the last argument.  ... 
doi:10.1016/s1574-6526(07)03005-2 fatcat:jtfu4vfgqbfkzn64tp5yhbstoe

LogicalFactChecker: Leveraging Logical Operations for Fact Checking with Graph Module Network [article]

Wanjun Zhong, Duyu Tang, Zhangyin Feng, Nan Duan, Ming Zhou, Ming Gong, Linjun Shou, Daxin Jiang, Jiahai Wang, Jian Yin
2020 arXiv   pre-print
Such a graph reveals the related contexts of each word in the statement, the table and the program.  ...  In this work, we propose LogicalFactChecker, a neural network approach capable of leveraging logical operations for fact checking.  ...  To address this problem, we use the graph structure to re-define the related contexts of each token for learning a graph-enhanced representation.  ... 
arXiv:2004.13659v1 fatcat:gwsd5uihhja4rngarzw3jmm4gi

Present and Future of Formal Argumentation (Dagstuhl Perpectives Workshop 15362)

Dov M. Gabbay, Massimiliano Giacomin, Beishui Liao, Leendert Van Der Torre, Marc Herbstritt
2016 Dagstuhl Reports  
Moreover, working group activity lead to identify several open problems in argumentation.  ...  This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 15362 "Present and Future of Formal Argumentation".  ...  contexts.  ... 
doi:10.4230/dagrep.5.8.74 dblp:journals/dagstuhl-reports/GabbayGLT15 fatcat:htoo2zzpi5hyjogjeck2m6iilm

Compositionality, Relevance, and Peirce's Logic of Existential Graphs

Ahti-Veikko Pietarinen
2005 Axiomathes  
Contextual features influenced his logic of Existential Graphs (EG). Arguments are presented pro and con the view in which EGs endorse noncompositionality of meaning.  ...  Peirce's pragmatist theory of logic teaches us to take the context of utterances as an indispensable logical notion without which there is no meaning.  ...  What these results show is that the meaning of a sentence which varies between contexts is not in conflict with compositionality as such, for contexts may be provided as extra arguments in the meaning  ... 
doi:10.1007/s10516-004-7683-4 fatcat:75c5xlhvgre3nmciwbnjpzimqm

A New Style of Proof for Mathematics Organized as a Network of Axiomatic Theories [article]

William M. Farmer
2018 arXiv   pre-print
Theory graphs are well suited for organizing large bodies of mathematical knowledge.  ...  A theory graph is a network of axiomatic theories connected with meaning-preserving mappings called theory morphisms.  ...  Acknowledgments The author would like to thank the referees for their comments. This research was supported by NSERC.  ... 
arXiv:1806.00810v2 fatcat:nkwqk4mzknbvlpjaygkgepay5y

Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis [chapter]

Guy Mineau, Gerd Stumme, Rudolf Wille
1999 Lecture Notes in Computer Science  
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation by Peirce's Pragmatism  ...  As logical operators, the numerous context constructions for one-and many-valued contexts may be considered; the mostly used context construction is the semiproduct which is basic for`plain conceptual  ...  Since power context families can always be derived from many-valued data contexts, the approach via Contextual Logic opens a large eld of common applications for Conceptual Graphs and Formal Concept Analysis  ... 
doi:10.1007/3-540-48659-3_27 fatcat:hoc4pwfqufcstl5h5thkhdhgqy

From Formal Concept Analysis to Contextual Logic [chapter]

Frithjof Dau, Julia Klinger
2005 Lecture Notes in Computer Science  
argumentations only.  ...  logical theory: The first step towards a syntactical implementation of concept graphs is the definition of an alphabet A := (G, C, R) consisting of a set G of object names, an ordered set C of concept  ... 
doi:10.1007/11528784_4 fatcat:7onfabgpxfhphpjhjn26glsjoy

SMProbLog: Stable Model Semantics in ProbLog and its Applications in Argumentation [article]

Pietro Totis, Angelika Kimmig, Luc De Raedt
2021 arXiv   pre-print
A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent  ...  We introduce SMProbLog, a generalization of the probabilistic logic programming language ProbLog.  ...  At the same time, we propose a mapping from probabilistic argument graphs to probabilistic logic programs, which provides a novel semantics for epistemic argument graphs.  ... 
arXiv:2110.01990v2 fatcat:luax2uanmvcpvmdqhyrfrwvxce

Conceptual graphs and formal concept analysis [chapter]

Rudolf Wille
1997 Lecture Notes in Computer Science  
For this, a translation of conceptual graphs to formal contexts and concept lattices is described through an example.  ...  Using a suitable mathematization of conceptual graphs, basics of a uni ed mathematical theory for Elementary Logic are proposed.  ...  This connection should be elaborated toward a uni ed mathematical theory of Elementary Logic suitable for knowledge representation and processing.  ... 
doi:10.1007/bfb0027878 fatcat:2se66tjlzrgfbgpe6ihhv2dryy
« Previous Showing results 1 — 15 out of 75,190 results