Suchergebnisse - "[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]"

  1. 1

    Learning from interpretation transition von Inoue, Katsumi, Ribeiro, Tony, Sakama, Chiaki

    ISSN: 0885-6125, 1573-0565
    Veröffentlicht: New York Springer US 01.01.2014
    Veröffentlicht in Machine learning (01.01.2014)
    “… We propose a novel framework for learning normal logic programs from transitions of interpretations. Given a set of pairs of interpretations ( I , J ) such …”
    Volltext
    Journal Article
  2. 2

    Packing Arc-Disjoint Cycles in Tournaments von Bessy, Stéphane, Bougeret, Marin, Krithika, R., Sahu, Abhishek, Saurabh, Saket, Thiebaut, Jocelyn, Zehavi, Meirav

    ISSN: 0178-4617, 1432-0541
    Veröffentlicht: Springer Science and Business Media LLC 04.01.2021
    Veröffentlicht in Algorithmica (04.01.2021)
    Volltext
    Journal Article
  3. 3

    Induced betweenness in order-theoretic trees von Courcelle, Bruno

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Veröffentlicht: DMTCS 17.09.2022
    “… The ternary relation B(x,y,z) of betweenness states that an element y is between the elements x and z, in some sense depending on the considered structure. In …”
    Volltext
    Journal Article
  4. 4
  5. 5

    Parallelism and Synchronization in an Infinitary Context von Dal Lago, Ugo, Faggian, Claudia, Valiron, Benoit, Yoshimizu, Akira

    ISSN: 1043-6871
    Veröffentlicht: IEEE 01.07.2015
    “… We study multitoken interaction machines in the context of a very expressive linear logical system with exponentials, fix points and synchronization. The …”
    Volltext
    Tagungsbericht
  6. 6

    A Type System Describing Unboundedness von Parys, Paweł

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Veröffentlicht: Nancy DMTCS 01.08.2020
    “… We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows …”
    Volltext
    Journal Article
  7. 7

    A Note on Intensionalization von de Groote, Philippe, Kanazawa, Makoto

    ISSN: 0925-8531, 1572-9583
    Veröffentlicht: Springer Science and Business Media LLC 01.04.2013
    Veröffentlicht in Journal of Logic, Language and Information (01.04.2013)
    Volltext
    Journal Article
  8. 8

    IMP with exceptions over decorated logic von Ekici, Burak

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Veröffentlicht: Nancy DMTCS 29.10.2018
    “… In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) …”
    Volltext
    Journal Article
  9. 9

    Language Preservation Problems in Parametric Timed Automata von André, Étienne, Lime, Didier, Markey, Nicolas

    ISSN: 1860-5974, 1860-5974
    Veröffentlicht: episciences.org 01.01.2018
    Veröffentlicht in Logical Methods in Computer Science (01.01.2018)
    Volltext
    Journal Article
  10. 10

    A Recommender System Based on Multi-Criteria Aggregation von Fomba, Soumana, Zarate, Pascale, Kilgour, Marc, Camilleri, Guy, Konate, Jacqueline, Tangara, Fana

    ISSN: 1941-6296, 1941-630X
    Veröffentlicht: Hershey IGI Global 01.10.2017
    “… Recommender systems aim to support decision-makers by providing decision advice. We review briefly tools of Multi-Criteria Decision Analysis (MCDA), including …”
    Volltext
    Journal Article
  11. 11

    Formal security proofs with minimal fuss: Implicit computational complexity at work von Nowak, David, Zhang, Yu

    ISSN: 0890-5401
    Veröffentlicht: Elsevier BV 01.04.2015
    Veröffentlicht in Information and Computation (01.04.2015)
    Volltext
    Journal Article
  12. 12

    A Note on Intensionalization von de Groote, Philippe, Kanazawa, Makoto

    ISSN: 0925-8531, 1572-9583
    Veröffentlicht: Dordrecht Springer 01.04.2013
    Veröffentlicht in Journal of logic, language, and information (01.04.2013)
    “… Building on Ben-Avi and Winter's (2007) work, this paper provides a general "intensionalization" procedure that turns an extensional semantics for a language …”
    Volltext
    Journal Article
  13. 13
  14. 14
  15. 15

    Trees in Partial Higher Dimensional Automata

    ISBN: 9783030171261, 3030171264
    Veröffentlicht: Switzerland Springer International Publishing AG 01.01.2019
    Volltext
    Buchkapitel
  16. 16

    Confluence for classical logic through the distinction between values and computations von Espírito Santo, José, Matthes, Ralph, Nakazawa, Koji, Pinto, Luís

    ISSN: 2075-2180, 2075-2180
    Veröffentlicht: Open Publishing Association 09.09.2014
    “… We apply an idea originated in the theory of programming languages - monadic meta-language with a distinction between values and computations - in the design …”
    Volltext
    Journal Article
  17. 17

    Non-Determinism and Nash Equilibria for Sequential Game over Partial Order von Le Roux, Stéphane

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Veröffentlicht: Centre pour la Communication Scientifique Directe (CCSD) 01.01.2005
    Veröffentlicht in Discrete Mathematics & Theoretical Computer Science (01.01.2005)
    “… In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if …”
    Volltext
    Journal Article Tagungsbericht
  18. 18

    A Relative PCF-Definability Result for Strongly Stable Functions and some Corollaries von Ehrhard, Thomas

    ISSN: 0890-5401
    Veröffentlicht: Elsevier BV 01.06.1999
    Veröffentlicht in Information and Computation (01.06.1999)
    Volltext
    Journal Article
  19. 19

    From Focalization of Logic to the Logic of Focalization von Basaldella, Michele, Saurin, Alexis, Terui, Kazushige

    ISSN: 1571-0661, 1571-0661
    Veröffentlicht: Elsevier B.V 06.09.2010
    Veröffentlicht in Electronic notes in theoretical computer science (06.09.2010)
    “… Andreoli originally discovered focalization as a concrete proof search strategy in proof theory of linear logic, putting to the foreground the role of polarity …”
    Volltext
    Journal Article
  20. 20

    The call-by-value λµ∧∨-calculus von Nour, Karim, Saber, Khelifa

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Veröffentlicht: DMTCS 01.01.2005
    “… In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an …”
    Volltext
    Journal Article Tagungsbericht