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

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

Volltext

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

“… We propose a novel framework for learning normal logic programs from transitions of interpretations …”
Volltext

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

“… We study multitoken interaction machines in the context of a very expressive linear logical system with exponentials, fix points and synchronization. The …”
Volltext

Induced betweenness in order-theoretic trees von Courcelle, Bruno

“… 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

Almost envy-free allocations with connected bundles von Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker

Volltext

A Type System Describing Unboundedness von Parys, Paweł

“… 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

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

Volltext

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

“… 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

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

Volltext

IMP with exceptions over decorated logic von Ekici, Burak

“… ”that describe what computational (side) effect evaluation of a term may involve. In a point-free categorical language,called the “decorated logic …”
Volltext

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

“… Recommender systems aim to support decision-makers by providing decision advice. We review briefly tools of Multi-Criteria Decision Analysis (MCDA), including …”
Volltext

Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD) von Laleau, Régine, Méry, Dominique, Nakajima, Shin, Troubitsyna, Elena

Volltext

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

Volltext

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

Volltext

Trees in Partial Higher Dimensional Automata

Volltext

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

“… We apply an idea originated in the theory of programming languages - monadic meta-language with a distinction between values and computations - in the design of a calculus of cut-elimination for classical logic …”
Volltext

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

“… In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if …”
Volltext

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

“… Andreoli originally discovered focalization as a concrete proof search strategy in proof theory of linear logic, putting to the foreground the role of polarity in logic …”
Volltext

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

Volltext

Classical Combinatory Logic von Nour, Karim

“… Combinatory logic shows that bound variables can be eliminated without loss of expressiveness …”
Volltext