Belief Reports and Compositional Semantics

2007 ◽  
pp. 205-233
Author(s):  
Michael Glanzberg

This chapter examines how concepts relate to lexical meanings. It focuses on how we can appeal to concepts to give specific, cognitively rich contents to lexical entries, while at the same time using standard methods of compositional semantics. This is a problem, as those methods assume lexical meanings provide extensions, while concepts are mental representations that have very different structure from an extension. The chapter proposes a way to solve this problem which is by casting concepts in a metasemantic role for certain expressions, notably verbs, but more also generally, with expressions that function as content-giving predicates in a sentence.


Synthese ◽  
2016 ◽  
Vol 195 (1) ◽  
pp. 269-285
Author(s):  
Seyed N. Mousavian ◽  
Mohammad Saleh Zarepour
Keyword(s):  

1990 ◽  
Vol 13 (2) ◽  
pp. 141-170
Author(s):  
Andrea Maggiolo-Schettini ◽  
Józef Winkowski

Timed Petri nets and their behaviours are considered. A concept of a seminet is introduced. which generalizes the concept of a net, and suitable operations on seminets are defined, which allow constructing seminets from atoms corresponding to places and transitions. The behaviours of seminets are given in the form of so called configuration systems, a notion close to labelled event structures. Such behaviours can be combined with the aid of operations corresponding to those on seminets. In particular, the behaviour of a compound seminet can be obtained by combining the behaviours of components.


Philosophia ◽  
2016 ◽  
Vol 45 (1) ◽  
pp. 35-47 ◽  
Author(s):  
Anthony Everett
Keyword(s):  

2014 ◽  
Vol 49 (9) ◽  
pp. 109-122
Author(s):  
Paul Downen ◽  
Zena M. Ariola

Author(s):  
Nicholas Welch ◽  
Marie-Louise Bouvier White

AbstractA widely accepted assumption in both the syntactic and semantic literature is that copulas lack semantic content. A consequent question is how to explain the existence in certain languages of two copular verbs that give rise to different interpretations. Such is the case in numerous languages of the Dene family (formerly known as Athapaskan). We explain this situation with the hypothesis that the copulas realize an underlying three-copula system differing in argument structure. Differences between the interpretations of copular clauses in these languages originate in the compositional semantics of these structures, not in any lexical semantic differences.This hypothesis successfully predicts the distributional differences between the surface forms of the Dene copulas, such as their compatibility with adjuncts of time and intentionality, interactions with accusative case, and semantic lifetime effects.


2011 ◽  
Vol 11 (4-5) ◽  
pp. 611-627
Author(s):  
ANTÓNIO PORTO

AbstractProlog's very useful expressive power is not captured by traditional logic programming semantics, due mainly to the cut and goal and clause order. Several alternative semantics have been put forward, exposing operational details of the computation state. We propose instead to redesign Prolog around structured alternatives to the cut and clauses, keeping the expressive power and computation model but with a compositional denotational semantics over much simpler states—just variable bindings. This considerably eases reasoning about programs, by programmers and tools such as a partial evaluator, with safe unfolding of calls through predicate definitions. Anif-then-elseacross clauses replaces most uses of the cut, but the cut's full power is achieved by anuntilconstruct. Disjunction, conjunction anduntil, along with unification, are the primitive goal types with a compositional semantics yielding sequences of variable-binding solutions. This extends to programs via the usual technique of a least fixpoint construction. A simple interpreter for Prolog in the alternative language, and a definition ofuntilin Prolog, establish the identical expressive power of the two languages. Many useful control constructs are derivable from the primitives, and the semantic framework illuminates the discussion of alternative ones. The formalisation rests on a term language with variable abstraction as in the λ-calculus. A clause is an abstraction on the call arguments, a continuation, and the local variables. It can be inclusive or exclusive, expressing a local case bound to a continuation by either a disjunction or anif-then-else. Clauses are open definitions, composed (and closed) with simple functional application β-reduction). This paves the way for a simple account of flexible module composition mechanisms.Cube, a concrete language with the exposed principles, has been implemented on top of a Prolog engine and successfully used to build large real-world applications.


Sign in / Sign up

Export Citation Format

Share Document