The Experts below are selected from a list of 28260 Experts worldwide ranked by ideXlab platform
Kjell Johan Saebo - One of the best experts on this subject based on the ideXlab platform.
-
focus interpretation in thetic statements Alternative Semantics and optimality theory pragmatics
Journal of Logic Language and Information, 2007Co-Authors: Kjell Johan SaeboAbstract:Broad focus (or informational integration or nonautonomy) is lexically and contextually constrained, but these constraints are not well understood. On a standard theory of focus interpretation, the presupposition of a broad focus is verified whenever those of two narrow foci are. I argue that to account for cases where two narrow foci are preferred, it is necessary to assume that broad focus competes with two narrow foci and implicates the opposite of what they presuppose. Central constraints on thetic statements are thus accounted for in an Optimality Theory (OT) enriched Alternative Semantics.
-
focus interpretation in thetic statements Alternative Semantics and ot pragmatics
2005Co-Authors: Kjell Johan SaeboAbstract:Broad focus (or informationalintegration or nonautonomy) is lexically and contextually constrained, but these constraints are not well understood. On a standard theory of focus interpretation, the presupposition of a broad focus is verified whenever those of two narrow foci are. I argue that to account for cases where two narrow foci are preferred, it is necessary to assume that broad focus competes with two narrow foci and implicates the opposite of what they presuppose. Central constraints on thetic statements are thus accounted for in an OT enriched Alternative Semantics.
Clemens Mayr - One of the best experts on this subject based on the ideXlab platform.
-
consequences of an Alternative Semantics for the analysis of intervention effects
2013Co-Authors: Clemens MayrAbstract:Consider the difference in acceptability between (1) and (2). If a negative quantifier intervenes between the two wh-expressions as in (1), the question is unacceptable. If the quantifier is replaced by a referential expression as in (2), the question becomes fine. The effect witnessed in (1) is referred to as an intervention effect. It is brought about by a range of intervening operators.
S.m.massachusetts Institute Of Technology. - One of the best experts on this subject based on the ideXlab platform.
-
Intervention effects in German : a contiguity approach
Massachusetts Institute of Technology, 2019Co-Authors: S.m.massachusetts Institute Of Technology.Abstract:Thesis: S.M., Massachusetts Institute of Technology, Department of Linguistics and Philosophy, 2019Cataloged from PDF version of thesis.Includes bibliographical references (pages 63-66).This paper explores to what extent Richards' Contiguity Theory can insightfully be applied to so-called Intervention Effects in German, a set of phenomena which were originally described as constraining the syntax in an interesting way and have mostly been studied in Alternative Semantics terms by S. Beck et al, and H. Kotek. Branan (2018) has offered a Contiguity-theoretic account of Japanese, Korean, and Mongolian intervention facts. I will try to do so for German here. German, as will be discussed, differs crucially from the languages explored by Branan's (2018) cross-linguistic study. Japanese, Korean, and Mongolian, being syntactically right-headed, prosodically left-active languages, first destroy but then reestablish a Contiguous Probe-Goal relationship in the course of the derivation of intervention effect examples. In German, a prosodically left-active but syntactically mixed-headed language, by contrast, Contiguity relationships in multiple wh-questions are terminally destroyed in intervention configurations. This, I claim, triggers the familiar unacceptability judgments. I will further show that, contrary to the languages that Branan examines, in German the effect of Grouping cannot be observed in the prosody.by Verena Hehl.S.M.S.M. Massachusetts Institute of Technology, Department of Linguistics and Philosoph
Joseph Y. Halpern - One of the best experts on this subject based on the ideXlab platform.
-
Alternative Semantics for Unawareness
Games and Economic Behavior, 2001Co-Authors: Joseph Y. HalpernAbstract:Modica and Rustichini [Theory and Decision 37, 1994] provided a logic for reasoning about knowledge where agents may be unaware of certain propositions. However, their original approach had the unpleasant property that nontrivial unawareness was incompatible with partitional information structures. More recently [Games and Economic Behavior 27:2, 1999], they have provided an approach that allows for nontrivial unawareness in partitional information structures. Here it is shown that their approach can be viewed as a special case of a general approach to unawareness considered by Fagin and Halpern [Artificial Intelligence 34, 1988].
-
Alternative Semantics for Unawareness
Games and Economic Behavior, 2001Co-Authors: Joseph Y. HalpernAbstract:Abstract S. Modica and A. Rustichini (1994, Theory and Decision 37 , 107–124) provided a logic for reasoning about knowledge where agents may be unaware of certain propositions. However, their original approach had the unpleasant property that nontrivial unawareness was incompatible with partitional information structures. More recently, Modica and Rustichini (1999, Games Econ. Behav. 27 , 265–298) have provided an approach that allows for nontrivial unawareness in partitional information structures. Here it is shown that their approach can be viewed as a special case of a general approach to unawareness considered by R. Fagin and J. Y. Halpern (1988, Artificial Intelligence 34 , 39–76). Journal of Economic Literature Classification Numbers: D80, D83.
-
Alternative Semantics for Unawareness
Research Papers in Economics, 2000Co-Authors: Joseph Y. HalpernAbstract:Modica and Rustichini [Theory and Decision 37, 1994] provided a logic for reasoning about knowledge where agents may be unaware of certain propositions. However, their original approach had the unpleasant property that nontrivial unawareness was incompatible with partitional information structures. More recently, Modica and Rustichini [Games and Economic Behavior 27:2, 1999] have provided an approach that allows for nontrivial unawareness in partitional information structures. Here it is shown that their approach can be viewed as a special case of a general approach to unawareness considered by Fagin and Halpern [Artificial Intelligence 34, 1988].
Antonio Porto - One of the best experts on this subject based on the ideXlab platform.
-
a structured Alternative to prolog with simple compositional Semantics
arXiv: Programming Languages, 2011Co-Authors: Antonio PortoAbstract:Prolog'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. An if-then-else across clauses replaces most uses of the cut, but the cut's full power is achieved by an until construct. Disjunction, conjunction and until, 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 of until in 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 {\lambda}-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 an if-then-else. Clauses are open definitions, composed (and closed) with simple functional application ({\beta}-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.