SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:0925 8531 OR L773:1572 9583 "

Sökning: L773:0925 8531 OR L773:1572 9583

  • Resultat 1-10 av 31
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Angelov, Krasimir, 1978, et al. (författare)
  • PGF: A Portable Run-time Format for Type-theoretical Grammars
  • 2010
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 19:2, s. 201-228
  • Tidskriftsartikel (refereegranskat)abstract
    • Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems.
  •  
2.
  • Bernardy, Jean-Philippe, 1978, et al. (författare)
  • A Computational Treatment of Anaphora and its Algorithmic Implementation
  • 2021
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 30, s. 1-29
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach-Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.
  •  
3.
  • Cantwell, John (författare)
  • A Formal Model of Multi-Agent Belief-Interaction
  • 2006
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 15:4, s. 303-329
  • Tidskriftsartikel (refereegranskat)abstract
    • A semantics is presented for belief revision in the face of common announcements to a group of agents that have beliefs about each other's beliefs. The semantics is based on the idea that possible worlds can be viewed as having an internal-structure, representing the belief independent features of the world, and the respective belief states of the agents in a modular fashion. Modularity guarantees that changing one aspect of the world (a belief independent feature or a belief state) has no effect on any other aspect of the world. This allows us to employ an AGM-style selection function to represent revision. The semantics is given a complete axiomatisation (identical to the axiomatisation found by Gerbrandy and Groeneveld for a semantics based on non-wellfounded set theory) for the special case of expansion.
  •  
4.
  • Cantwell, John (författare)
  • An Expressivist Bilateral Meaning-is-Use Analysis of Classical Propositional Logic
  • 2014
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 24:1, s. 27-51
  • Tidskriftsartikel (refereegranskat)abstract
    • The connectives of classical propositional logic are given an analysis in terms of necessary and sufficient conditions of acceptance and rejection, i.e. the connectives are analyzed within an expressivist bilateral meaning-is-use framework. It is explained how such a framework differs from standard (bilateral) inferentialist frameworks and it is argued that it is better suited to address the particular issues raised by the expressivist thesis that the meaning of a sentence is determined by the mental state that it is conventionally used to express. Furthermore, it is shown that the classical requirements governing the connectives completely characterize classical logic, are conservative (indeed make the connectives redundant) and separable, are in bilateral harmony, are structurally preservative with respect to the classical coordination requirements and resolve the categoricity problem. These results are taken to show that one can give an expressivist bilateral meaning-is-use analysis of the connectives that confer on them a determinate coherent classical interpretation.
  •  
5.
  • Chatzikyriakidis, Stergios, 1980, et al. (författare)
  • Adjectival and Adverbial Modification: The View from Modern Type Theories
  • 2017
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 26:1, s. 45-88
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper we present a study of adjectival/adverbial modification using modern type theories (MTTs), i.e. type theories within the tradition of Martin-Lof. We present an account of various issues concerning adjectival/adverbial modification and argue that MTTs can be used as an adequate language for interpreting NL semantics. MTTs are not only expressive enough to deal with a range of modification phenomena, but are furthermore well-suited to perform reasoning tasks that can be easily implemented (e.g. in proof-assistants) given their proof-theoretic nature. In MTT-semantics, common nouns are interpreted as types rather than predicates. Therefore, in order to capture the semantics of adjectives adequately, one needs to meet the challenge of modeling CNs modified by adjectives as types. To explicate that this can be done successfully, we first look at the mainstream classification of adjectives, i.e. intersective, subsective and non-subsective adjectives. There, we show that the rich type structure available in MTTs, along with a suitable subtyping framework, offers an adequate mechanism to model these cases. In particular, this modelling naturally takes care of the characterising inferences associated with each class of adjectives. Then, more advanced issues on adjectival modification are discussed: (a) degree adjectives, (b) comparatives and (c) multidimensional adjectives. There, it is shown that the use of indexed types can be usefully applied in order to deal with these cases. In the same vein, the issue of adverbial modification is discussed. We study two general typings for sentence and VP adverbs respectively. It is shown that the rich type structure in MTTs further provides useful organisational mechanisms in giving formal semantics for adverbs. In particular, we discuss the use of -types to capture the veridicality/non-veridicality distinction and further discuss cases of intensional adverbs using the type theoretic notion of context (i.e. without resorting to intensional typing). We also look at manner, subject and speech act adverbials and propose solutions using MTTs. Finally, we show that the current proof technology can help mechanically check the associated inferences. A number of our proposals concerning adjectival and adverbial modification have been formalised in the proof assistant Coq and many of the associated inference patterns are checked to be correctly captured.
  •  
6.
  • Chatzikyriakidis, Stergios, 1980 (författare)
  • Underspecification, Parsing Mismatches and Routinisation: The Historical Development of the Clitic Systems of Greek Dialects
  • 2021
  • Ingår i: Journal of Logic Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 30, s. 277-304
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, the historical development of the clitic systems of Standard Modern, Cypriot and Pontic Greek is discussed. These three varieties not only present the whole range of variation one can find across clitic systems in Greek but, furthermore, derive from a common linguistic ancestor, i.e. Koine Greek. This paper argues that the transition from Koine Greek to the Medieval varieties and from the Medieval varieties to the respective modern ones can be explained by making the assumption that routinisation (in the sense of Pickering and Garrod in Behav Brain Sci 27:169-226, 2004) and parsing/hearer assymetries are two important factors behind syntactic change. The claim is that the transition from Koine to the Medieval Greek varieties involves the emergence of a clitic system with encoded syntactic constraints out of a freer one, where clitic positioning was regulated by pragmatic preferences rather than syntactic constraints. Then, the transition to the modern varieties from the respective medieval ones is explained, at least partly, on the assumption that production/parsing mismatches are capable of triggering syntactic change. This last assumption combined with: (a) the tendency to obtain more generalised parsing triggers for parsing the individual clitics and (b) the fact that the Medieval varieties in question differ in minimal but crucial ways, provides us an explanation for the transition to the modern varieties.
  •  
7.
  • Christoff, Zoé, et al. (författare)
  • Reflecting on Social Influence in Networks
  • 2016
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 25:3-4, s. 299-333
  • Tidskriftsartikel (refereegranskat)abstract
    • In many social contexts, social influence seems to be inescapable: the behavior of others influences us to modify ours, and vice-versa. However, social psychology is full of examples of phenomena where individuals experience a discrepancy between their public behavior and their private opinion. This raises two central questions. First, how does an individual reason about the behavior of others and their private opinions in situations of social influence? And second, what are the laws of the resulting information dynamics? In this paper, we address these questions by introducing a formal framework for representing reasoning about an individual’s private opinions and public behavior under the dynamics of social influence in social networks. Moreover, we dig deeper into the involved information dynamics by modeling how individuals can learn about each other based on this reasoning. This compels us to introduce a new formal notion of reflective social influence. Finally, we initialize the work on proof theory and automated reasoning for our framework by introducing a sound and complete tableaux system for a fragment of our logic. Furthermore, this constitutes the first tableau system for the “Facebook logic” of J. Seligman, F. Liu, and P. Girard.
  •  
8.
  • Cooper, Robin, 1947 (författare)
  • Representing Types as Neural Events
  • 2019
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 28:2, s. 131-155
  • Tidskriftsartikel (refereegranskat)
  •  
9.
  • Engström, Fredrik, 1977 (författare)
  • Generalized quantifiers in dependence logic
  • 2012
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 21:3, s. 299-324
  • Tidskriftsartikel (refereegranskat)abstract
    • We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in fact definably equivalent to the independence atom recently introduced by Väänänen and Grädel.
  •  
10.
  • Genot, Emmanuel, et al. (författare)
  • Logical Dialogues with Explicit Preference Profiles and Strategy Selection
  • 2017
  • Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 1572-9583 .- 0925-8531. ; 26:3, s. 261-291
  • Tidskriftsartikel (refereegranskat)abstract
    • The Barth–Krabbe–Hintikka–Hintikka Problem, independently raised by Barth and Krabbe (From axiom to dialogue: a philosophical study of logics and argumentation. Walter de Gruyter, Berlin, 1982) and Hintikka and Hintikka (The sign of three: Peirce, Dupin, Holmes. In: Eco U, Sebeok TA (eds) Sherlock Holmes confronts modern logic: Toward a theory of information-seeking through questioning. Indiana University Press, Bloomington, 1983), is the problem of characterizing the strategic reasoning of the players of dialogical logic and game-theoretic semantics games from rational preferences rather than rules. We solve the problem by providing a set of preferences for players with bounded rationality and specifying strategic inferences from those preferences, for a variant of logical dialogues. This solution is generalized to both game-theoretic semantics and orthodox dialogical logic (classical and intuitionistic).
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 31
Typ av publikation
tidskriftsartikel (31)
Typ av innehåll
refereegranskat (31)
Författare/redaktör
Chatzikyriakidis, St ... (4)
Hansson, Sven Ove (3)
Cooper, Robin, 1947 (3)
Gärdenfors, Peter (2)
Bernardy, Jean-Phili ... (2)
Ranta, Aarne, 1963 (2)
visa fler...
Strannegård, Claes, ... (2)
Howes, Christine, 19 ... (2)
Cantwell, John (2)
Engström, Fredrik, 1 ... (2)
Gärling, Tommy, 1941 (1)
Goranko, Valentin, 1 ... (1)
Luo, Z. (1)
Angelov, Krasimir, 1 ... (1)
Lappin, Shalom, 1950 (1)
Zhang, Li (1)
Eriksson, Stefan, 19 ... (1)
Bringert, Björn, 197 ... (1)
Genot, Emmanuel (1)
Helgesson, Gert (1)
Pagin, Peter, 1953- (1)
Christoff, Zoé (1)
Hansen, Jens Ulrik (1)
Gibson, Hannah (1)
Maskharashvili, Alek ... (1)
Grove, Julian, 1988 (1)
Proietti, Carlo (1)
Ginzburg, Jonathan (1)
Osta-Vélez, Matías (1)
Nizamani, Abdul Rahi ... (1)
Jacot, Justine (1)
Glüer, Kathrin, 1966 ... (1)
Ju, Fengkui (1)
Kuusisto, Antti (1)
Eshghi, A. (1)
Kaså, Martin, 1974 (1)
Xue, T. (1)
Nygren, Karl (1)
Luo, Z. H. (1)
Ulfsbäcker, Simon (1)
Rips, Lance (1)
Hedqvist, David, 198 ... (1)
Zwarts, Joost (1)
visa färre...
Lärosäte
Göteborgs universitet (16)
Kungliga Tekniska Högskolan (6)
Stockholms universitet (4)
Lunds universitet (4)
Uppsala universitet (3)
Chalmers tekniska högskola (3)
visa fler...
Karolinska Institutet (1)
visa färre...
Språk
Engelska (31)
Forskningsämne (UKÄ/SCB)
Humaniora (27)
Naturvetenskap (14)
Medicin och hälsovetenskap (1)
Samhällsvetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy