output
20042026
most citedResUNet-a: a deep learning framework for semantic segmentation of remotely sensed data

2.2k citations

Showing 2013 · cs.LOShow all

6 papers · 2 filters

cs.LO2013★ 1 cited

Strategic Argumentation is NP-Complete

Guido Governatori, Francesco Olivieri, Simone Scannapieco +2

In this paper we study the complexity of strategic argumentation for dialogue games. A dialogue game is a 2-player game where the parties play arguments. We show how to model dialo…

cs.LO2013★ 21 cited

On Characterising Distributability

Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann

We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and prec…

cs.LO2013

Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Corrected and Extended Version)

Christian Drescher, Toby Walsh

Many native ASP solvers exploit unfounded sets to compute consequences of a logic program via some form of well-founded negation, but disregard its contrapositive, well-founded jus…

cs.LO2013★ 1 cited

Unsatisfiable Cores for Constraint Programming

Nicholas Downing, Thibaut Feydy, Peter J. Stuckey

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cos…

cs.LO2013

Global SPACING Constraint (Technical Report)

Nina Narodytska, Peter Skocovsky, Toby Walsh

We propose a new global SPACING constraint that is useful in modeling events that are distributed over time, like learning units scheduled over a study program or repeated patterns…

cs.LO2013★ 4 cited

From propositional to first-order monitoring

Andreas Bauer, Jan-Christoph Küster, Gil Vegliach

The main purpose of this paper is to introduce a first-order temporal logic, LTLFO, and a corresponding monitor construction based on a new type of automaton, called spawning autom…