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

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

“…We propose a novel framework for learning normal logic programs from transitions of interpretations. Given a set of pairs of interpretations ( I , J ) such…”
Get full text

Induced betweenness in order-theoretic trees by 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…”
Get full text

Parallelism and Synchronization in an Infinitary Context by 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…”
Get full text

A Type System Describing Unboundedness by 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…”
Get full text

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

Get full text

IMP with exceptions over decorated logic by Ekici, Burak

“…In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side)…”
Get full text

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

Get full text

A Recommender System Based on Multi-Criteria Aggregation by 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…”
Get full text

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

Get full text

A Note on Intensionalization by 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…”
Get full text

Trees in Partial Higher Dimensional Automata

Get full text

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

Get full text

Confluence for classical logic through the distinction between values and computations by 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…”
Get full text

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

Get full text

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) by Laleau, Régine, Méry, Dominique, Nakajima, Shin, Troubitsyna, Elena

Get full text

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

Get full text

Non-Determinism and Nash Equilibria for Sequential Game over Partial Order by 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…”
Get full text

From Focalization of Logic to the Logic of Focalization by 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…”
Get full text

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

“…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…”
Get full text

Solving equations over small unary algebras by Broniek, Przemyslaw

“…We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras…”
Get full text