Results for 'Computational semantics'

1000+ found
Order:
  1.  99
    Syntax, Semantics, and Computer Programs.William J. Rapaport - 2020 - Philosophy and Technology 33 (2):309-321.
    Turner argues that computer programs must have purposes, that implementation is not a kind of semantics, and that computers might need to understand what they do. I respectfully disagree: Computer programs need not have purposes, implementation is a kind of semantic interpretation, and neither human computers nor computing machines need to understand what they do.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  2. Semantics and the Computational Paradigm in Cognitive Psychology.Eric Dietrich - 1989 - Synthese 79 (1):119-141.
    There is a prevalent notion among cognitive scientists and philosophers of mind that computers are merely formal symbol manipulators, performing the actions they do solely on the basis of the syntactic properties of the symbols they manipulate. This view of computers has allowed some philosophers to divorce semantics from computational explanations. Semantic content, then, becomes something one adds to computational explanations to get psychological explanations. Other philosophers, such as Stephen Stich, have taken a stronger view, advocating doing (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  3. Syntactic Semantics: Foundations of Computational Natural Language Understanding.William J. Rapaport - 1988 - In James H. Fetzer (ed.), Aspects of AI. Kluwer Academic Publishers.
    This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  4. Understanding Understanding: Syntactic Semantics and Computational Cognition.William J. Rapaport - 1995 - Philosophical Perspectives 9:49-88.
    John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  5. The False Dichotomy Between Causal Realization and Semantic Computation.Marcin Miłkowski - 2017 - Hybris. Internetowy Magazyn Filozoficzny 38:1-21.
    In this paper, I show how semantic factors constrain the understanding of the computational phenomena to be explained so that they help build better mechanistic models. In particular, understanding what cognitive systems may refer to is important in building better models of cognitive processes. For that purpose, a recent study of some phenomena in rats that are capable of ‘entertaining’ future paths (Pfeiffer and Foster 2013) is analyzed. The case shows that the mechanistic account of physical computation may be (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  6. Conceptual Atomism and the Computational Theory of Mind: A Defense of Content-Internalism and Semantic Externalism.John-Michael Kuczynski - 2007 - John Benjamins & Co.
    Contemporary philosophy and theoretical psychology are dominated by an acceptance of content-externalism: the view that the contents of one's mental states are constitutively, as opposed to causally, dependent on facts about the external world. In the present work, it is shown that content-externalism involves a failure to distinguish between semantics and pre-semantics---between, on the one hand, the literal meanings of expressions and, on the other hand, the information that one must exploit in order to ascertain their literal meanings. (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  7. Cognitive Computation Sans Representation.Paul Schweizer - 2017 - In Thomas Powers (ed.), Philosophy and Computing: Essays in epistemology, philosophy of mind, logic, and ethics,. Cham, Switzerland: Springer. pp. 65-84.
    The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  89
    Computers Aren’T Syntax All the Way Down or Content All the Way Up.Cem Bozşahin - 2018 - Minds and Machines 28 (3):543-567.
    This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms, rather than enumerated by behavioral examples, can be more than instrumental tools in science, and more than source of analogies and taxonomies in philosophy. They can help us understand semantic content and its relation to form. This can be achieved because they have (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  9. Turing Machines and Semantic Symbol Processing: Why Real Computers Don’T Mind Chinese Emperors.Richard Yee - 1993 - Lyceum 5 (1):37-59.
    Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, Searle's Chinese room (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10.  50
    Meinongian Semantics and Artificial Intelligence.William J. Rapaport - 2013 - Humana Mente 6 (25):25-52.
    This essay describes computational semantic networks for a philosophical audience and surveys several approaches to semantic-network semantics. In particular, propositional semantic networks are discussed; it is argued that only a fully intensional, Meinongian semantics is appropriate for them; and several Meinongian systems are presented.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Investigations Into Information Semantics and Ethics of Computing.Gordana Dodig Crnkovic - 2006 - Dissertation, Mälardalen University
    http://www.diva-portal.org/mdh/theses/abstract.xsql?dbid=153.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. Mechanistic Computational Individuation Without Biting the Bullet.Nir Fresco & Marcin Miłkowski - 2019 - British Journal for the Philosophy of Science:axz005.
    Is the mathematical function being computed by a given physical system determined by the system’s dynamics? This question is at the heart of the indeterminacy of computation phenomenon (Fresco et al. [unpublished]). A paradigmatic example is a conventional electrical AND-gate that is often said to compute conjunction, but it can just as well be used to compute disjunction. Despite the pervasiveness of this phenomenon in physical computational systems, it has been discussed in the philosophical literature only indirectly, mostly with (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Semantic Externalism and the Mechanics of Thought.Carrie Figdor - 2009 - Minds and Machines 19 (1):1-24.
    I review a widely accepted argument to the conclusion that the contents of our beliefs, desires and other mental states cannot be causally efficacious in a classical computational model of the mind. I reply that this argument rests essentially on an assumption about the nature of neural structure that we have no good scientific reason to accept. I conclude that computationalism is compatible with wide semantic causal efficacy, and suggest how the computational model might be modified to accommodate (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  14. Semantics in Support of Biodiversity: An Introduction to the Biological Collections Ontology and Related Ontologies.Ramona L. Walls, John Deck, Robert Guralnik, Steve Baskauf, Reed Beaman, Stanley Blum, Shawn Bowers, Pier Luigi Buttigieg, Neil Davies, Dag Endresen, Maria Alejandra Gandolfo, Robert Hanner, Alyssa Janning, Barry Smith & Others - 2014 - PLoS ONE 9 (3):1-13.
    The study of biodiversity spans many disciplines and includes data pertaining to species distributions and abundances, genetic sequences, trait measurements, and ecological niches, complemented by information on collection and measurement protocols. A review of the current landscape of metadata standards and ontologies in biodiversity science suggests that existing standards such as the Darwin Core terminology are inadequate for describing biodiversity data in a semantically meaningful and computationally useful way. Existing ontologies, such as the Gene Ontology and others in the Open (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  15. Semantics, Hermenutics, Statistics: Some Reflections on the Semantic Web.Graham White - forthcoming - Proceedings of HCI2011.
    We start with the ambition -- dating back to the early days of the semantic web -- of assembling a significant portion human knowledge into a contradiction-free form using semantic web technology. We argue that this would not be desirable, because there are concepts, known as essentially contested concepts, whose definitions are contentious due to deep-seated ethical disagreements. Further, we argue that the ninetenth century hermeneutical tradition has a great deal to say, both about the ambition, and about why it (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  16.  60
    Computation Tree Logics and Temporal Logics with Reference Pointers.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. Sense and the Computation of Reference.Reinhard Muskens - 2004 - Linguistics and Philosophy 28 (4):473 - 504.
    The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  18. A Semantics for Virtual Environments and the Ontological Status of Virtual Objects.David Leech Anderson - 2009 - APA Newsletter on Philosophy and Computers 9 (1):15-19.
    Virtual environments engage millions of people and billions of dollars each year. What is the ontological status of the virtual objects that populate those environments? An adequate answer to that question requires a developed semantics for virtual environments. The truth-conditions must be identified for “tree”-sentences when uttered by speakers immersed in a virtual environment (VE). It will be argued that statements about virtual objects have truth-conditions roughly comparable to the verificationist conditions popular amongst some contemporary antirealists. This does not (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  19. Semiotic Systems, Computers, and the Mind: How Cognition Could Be Computing.William J. Rapaport - 2012 - International Journal of Signs and Semiotic Systems 2 (1):32-71.
    In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   14 citations  
  20. Proof-Theoretic Semantics for Subsentential Phrases.Nissim Francez, Roy Dyckhoff & Gilad Ben-Avi - 2010 - Studia Logica 94 (3):381-401.
    The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type interpretation (in arbitrary Henkin models). The (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  21. Situatedness and Embodiment of Computational Systems.Marcin Miłkowski - 2017 - Entropy 19 (4):162.
    In this paper, the role of the environment and physical embodiment of computational systems for explanatory purposes will be analyzed. In particular, the focus will be on cognitive computational systems, understood in terms of mechanisms that manipulate semantic information. It will be argued that the role of the environment has long been appreciated, in particular in the work of Herbert A. Simon, which has inspired the mechanistic view on explanation. From Simon’s perspective, the embodied view on cognition seems (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  22. Implementation is Semantic Interpretation.Willam J. Rapaport - 1999 - The Monist 82 (1):109-130.
    What is the computational notion of “implementation”? It is not individuation, instantiation, reduction, or supervenience. It is, I suggest, semantic interpretation.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  23. Symbol Grounding in Computational Systems: A Paradox of Intentions.Vincent C. Müller - 2009 - Minds and Machines 19 (4):529-541.
    The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior to symbol (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  24. First-Order Swap Structures Semantics for Some Logics of Formal Inconsistency.Marcelo E. Coniglio - forthcoming - Journal of Logic and Computation.
    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  25. The Structure of Semantic Competence: Compositionality as an Innate Constraint of The Faculty of Language.Guillermo Del Pinal - 2015 - Mind and Language 30 (4):375–413.
    This paper defends the view that the Faculty of Language is compositional, i.e., that it computes the meaning of complex expressions from the meanings of their immediate constituents and their structure. I fargue that compositionality and other competing constraints on the way in which the Faculty of Language computes the meanings of complex expressions should be understood as hypotheses about innate constraints of the Faculty of Language. I then argue that, unlike compositionality, most of the currently available non-compositional constraints predict (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. How Helen Keller Used Syntactic Semantics to Escape From a Chinese Room.William J. Rapaport - 2006 - Minds and Machines 16 (4):381-436.
    A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  27. Integration of Intelligence Data Through Semantic Enhancement.David Salmen, Tatiana Malyuta, Alan Hansen, Shaun Cronen & Barry Smith - 2011 - In Proceedings of the Conference on Semantic Technology in Intelligence, Defense and Security (STIDS). CEUR, Vol. 808.
    We describe a strategy for integration of data that is based on the idea of semantic enhancement. The strategy promises a number of benefits: it can be applied incrementally; it creates minimal barriers to the incorporation of new data into the semantically enhanced system; it preserves the existing data (including any existing data-semantics) in their original form (thus all provenance information is retained, and no heavy preprocessing is required); and it embraces the full spectrum of data sources, types, models, (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   8 citations  
  28. Commonsense Metaphysics and Lexical Semantics.Jerry R. Hobbs, William Croft, Todd Davies, Douglas Edwards & Kenneth Laws - 1987 - Computational Linguistics 13 (3&4):241-250.
    In the TACITUS project for using commonsense knowledge in the understanding of texts about mechanical devices and their failures, we have been developing various commonsense theories that are needed to mediate between the way we talk about the behavior of such devices and causal models of their operation. Of central importance in this effort is the axiomatization of what might be called commonsense metaphysics. This includes a number of areas that figure in virtually every domain of discourse, such as granularity, (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  29. Swap Structures Semantics for Ivlev-Like Modal Logics.Marcelo E. Coniglio & Ana Claudia Golzio - 2019 - Soft Computing 23 (7):2243-2254.
    In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Towards a Computational Account of Inferentialist Meaning.Paul Piwek - 2014
    Both in formal and computational natural language semantics, the classical correspondence view of meaning – and, more specifically, the view that the meaning of a declarative sentence coincides with its truth conditions – is widely held. Truth (in the world or a situation) plays the role of the given, and meaning is analysed in terms of it. Both language and the world feature in this perspective on meaning, but language users are conspicuously absent. In contrast, the inferentialist (...) that Robert Brandom proposes in his magisterial book ‘Making It Explicit’ puts the language user centre stage. According to his theory of meaning, the utterance of a sentence is meaningful in as far as it is a move by a language user in a game of giving and asking for reasons (with reasons underwritten by a notion of good inferences). In this paper, I propose a proof-theoretic formalisation of the game of giving and asking for reasons that lends itself to computer implementation. In the current proposal, I flesh out an account of defeasible inferences, a variety of inferences which play a pivotal role in ordinary (and scientific) language use. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  31. European Computing and Philosophy.Gordana Dodig-Crnkovic - 2009 - The Reasoner 3 (9):18-19.
    European Computing and Philosophy conference, 2–4 July Barcelona The Seventh ECAP (European Computing and Philosophy) conference was organized by Jordi Vallverdu at Autonomous University of Barcelona. The conference started with the IACAP (The International Association for CAP) presidential address by Luciano Floridi, focusing on mechanisms of knowledge production in informational networks. The first keynote delivered by Klaus Mainzer made a frame for the rest of the conference, by elucidating the fundamental role of complexity of informational structures that can be analyzed (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Cross-Linguistic Semantics for Questions.Maria Bittner - 1998 - Linguistics and Philosophy 21 (1):1-82.
    : The Hamblin-Karttunen approach has led to many insights about questions in English. In this article the results of this rule-by-rule tradition are reconsidered from a crosslinguistic perspective. Starting from the type-driven XLS theory developed in Bittner (1994a, b), it is argued that evidence from simple questions (in English, Polish, Lakhota and Warlpiri) leads to certain revisions. The revised XLS theory then immediately generalizes to complex questions — including scope marking (Hindi), questions with quantifiers (English) and multiple wh-questions (English, Hindi, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  92
    Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.
    A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.
    Download  
     
    Export citation  
     
    Bookmark  
  34. The HL7 Approach to Semantic Interoperability.Jobst Landgrebe & Barry Smith - 2011 - In Proceedings of the 2nd International Conference on Biomedical Ontology. CEUR, vol. 833. pp. 139-146.
    Health Level 7 (HL7) is an international standards development organisation in the domain of healthcare information technology. Initially the mission of HL7 was to enable data exchange via the creation of syntactic standards which supported point-to-point messaging. Currently HL7 sees its mission as one of creating standards for semantic interoperability in healthcare IT on the basis of its flagship “version 3” (v3). Unfortunately, v3 has been plagued by quality and consistency issues, and it has not been able to keep pace (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic. 2nd Ed.Luis M. Augusto - 2020 - London: College Publications.
    This is the 2nd edition of Computational logic. Vol. 1: Classical deductive computing with classical logic. This edition has a wholly new chapter on Datalog, a hard nut to crack from the viewpoint of semantics when negation is included.
    Download  
     
    Export citation  
     
    Bookmark  
  36. Semantical Mutation, Algorithms and Programs.Porto André - 2015 - Dissertatio (S1):44-76.
    This article offers an explanation of perhaps Wittgenstein’s strangest and least intuitive thesis – the semantical mutation thesis – according to which one can never answer a mathematical conjecture because the new proof alters the very meanings of the terms involved in the original question. Instead of basing our justification on the distinction between mere calculation and proofs of isolated propositions, characteristic of Wittgenstein’s intermediary period, we generalize it to include conjectures involving effective procedures as well.
    Download  
     
    Export citation  
     
    Bookmark  
  37. Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
    A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Intrinsically Semantic Content and the Intentionality of Propositional Attitudes.Sudan A. Turner - 2004 - Dissertation, University of Washington
    ABSTRACT -/- A propositional attitude (PA) is a belief, desire, fear, etc., that x is the case. This dissertation addresses the question of the semantic content of a specific kind of PA-instance: an instance of a belief of the form all Fs are Gs. The belief that all bachelors are sports fans has this form, while the belief that Spain is a country in Eastern Europe do not. Unlike a state of viewing the color of an orange, a belief-instance is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39.  75
    Semantic Interoperability in Healthcare. State of the Art in the US. A Position Paper with Background Materials.Werner Ceusters & Barry Smith - 2010 - In European Union ARGOS Project: Transatlantic Observatory for Meeting Global Health Policy Challenges through ICT-Enabled Solution.
    Semantic interoperability can be defined as the ability of two or more computer systems to exchange information in such a way that the meaning of that information can be automatically interpreted by the receiving system accurately enough to produce useful results to the end users of both systems. Several activities are currently being performed by a variety of stakeholders to achieve semantic interoperability in healthcare. Many of these activities are not beneficial, because they place too great a focus on business (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. Is Semantics Really Psychologically Real?Mihaela Popa-Wyatt - 2009 - In J. Larrazabal & L. Zubeldia (eds.), Meaning, Content and Argument. Proceedings of the ILCLI International Workshop on Semantics, Pragmatics, and Rhetoric. University of the Basque Country Press.. pp. 497-514.
    The starting point for this paper is a critical discussion of claims of psychological reality articulated within Borg’s (forth.) minimal semantics and Carpintero’s (2007) character*-semantics. It has been proposed, for independent reasons, that their respective accounts can accommodate, or at least avoid the challenge from psychological evidence. I outline their respective motivations, suggesting various shortcomings in their efforts of preserving the virtues of an uncontaminated semantics in the face of psychological objection (I-II), and try to make the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41.  79
    The Epistemic Inadequacy of Ersatzer Possible World Semantics.Michael J. Shaffer & Jeremy Morris - 2010 - Logique Et Analyse 53:61-76.
    In this paper it is argued that the conjunction of linguistic ersatzism, the ontologically deflationary view that possible worlds are maximal and consistent sets of sentences, and possible world semantics, the view that the meaning of a sentence is the set of possible worlds at which it is true, implies that no actual speaker can effectively use virtually any language to successfully communicate information. This result is based on complexity issues that relate to our finite computational ability to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  26
    Kripke Semantics for Fuzzy Logics.Saeed Salehi - 2018 - Soft Computing 22 (3):839–844.
    Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example, intuitionistic logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the basic logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models could provide a semantics for fuzzy logics. For each axiom of the basic fuzzy logic, necessary and sufficient conditions are sought for Kripke frames/models which satisfy them. It turns (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43.  51
    Algorithmic Correspondence and Completeness in Modal Logic. IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  86
    Space as a Semantic Unit of a Language Consciousness.Vitalii Shymko & Anzhela Babadzhanova - 2020 - Psycholinguistics 27 (1):335-350.
    Objective. Conceptualization of the definition of space as a semantic unit of language consciousness. -/- Materials & Methods. A structural-ontological approach is used in the work, the methodology of which has been tested and applied in order to analyze the subject matter area of psychology, psycholinguistics and other social sciences, as well as in interdisciplinary studies of complex systems. Mathematical representations of space as a set of parallel series of events (Alexandrov) were used as the initial theoretical basis of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Can a Computer Have a Religious Experience?Justin Charles Hite - manuscript
    A religious experience is a phenomenological occurrence which is interpreted by the perceiver in such a way as to affirm or strengthen the belief in a higher being or the beliefs of a particular religion. Religion and, therefore, religious experiences are primarily mental constructs. Computational theory of mind provides the strongest capabilities of applying mental activities to computers. However, cognitive science and philosophy needs to establish the link between beliefs and physical states in order for computational theory of (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  46.  28
    On Semantic Gamification.Ignacio Ojea Quintana - 2017 - In S. Ghosh & S. Prasad (eds.), Logic and its Applications, Lecture Notes in Computer Science 10119. Springer.
    The purpose of this essay is to study the extent in which the semantics for different logical systems can be represented game theoretically. I will begin by considering different definitions of what it means to gamify a semantics, and show completeness and limitative results. In particular, I will argue that under a proper definition of gamification, all finitely algebraizable logics can be gamified, as well as some infinitely algebraizable ones (like Łukasiewicz) and some non-algebraizable (like intuitionistic and van (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47.  28
    Modeling the Interaction of Computer Errors by Four-Valued Contaminating Logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. Berlín, Alemania: pp. 119-139.
    Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48.  32
    Sense, Reference, and Computation.Bruno Bentzen - 2020 - Perspectiva Filosófica 47 (2):179-203.
    In this paper, I revisit Frege's theory of sense and reference in the constructive setting of the meaning explanations of type theory, extending and sharpening a program–value analysis of sense and reference proposed by Martin-Löf building on previous work of Dummett. I propose a computational identity criterion for senses and argue that it validates what I see as the most plausible interpretation of Frege's equipollence principle for both sentences and singular terms. Before doing so, I examine Frege's implementation of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  59
    Formalizing UMLS Relations Using Semantic Partitions in the Context of a Task-Based Clinical Guidelines Model.Anand Kumar, Matteo Piazza, Barry Smith, Silvana Quaglini & Mario Stefanelli - 2004 - In IFOMIS Reports. Saarbrücken: IFOMIS.
    An important part of the Unified Medical Language System (UMLS) is its Semantic Network, consisting of 134 Semantic Types connected to each other by edges formed by one or more of 54 distinct Relation Types. This Network is however for many purposes overcomplex, and various groups have thus made attempts at simplification. Here we take this work further by simplifying the relations which involve the three Semantic Types – Diagnostic Procedure, Laboratory Procedure and Therapeutic or Preventive Procedure. We define operators (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000