Results 71 to 80 of about 570,700 (231)
Answer Set Programming and Combinatorial Voting [PDF]
, 2005 We show how Logic Programming with Ordered Disjunction (LPOD), the extension of answer set programming for handling preferences, may be used for representing and solving collective decision making problems.
Grabos, Rafal
core +1 more source
A System for Explainable Answer Set Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2020 We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. These annotations allow tracing the application of rules or the atoms derived by them. The input of xclingo is a markup language written as ASP comment lines, so the programs annotated in this way can still be accepted by a standard ASP solver ...
Pedro Cabalar +2 more
openaire +4 more sources
(Re)configuration based on model generation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Reconfiguration is an important activity for companies selling configurable products or services which have a long life time. However, identification of a set of required changes in a legacy configuration is a hard problem, since even small changes in ...
Gerhard Friedrich +5 more
doaj +1 more source
Complex optimization in answer set programming [PDF]
Theory and Practice of Logic Programming, 2011 AbstractPreference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity.
Gebser, Martin +2 more
openaire +4 more sources
Applications of Intuitionistic Logic in Answer Set Programming [PDF]
, 2003 We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given.
Arrazola, Jose +2 more
core
Modeling Stable Matching Problems with Answer Set Programming [PDF]
, 2013 The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications.
A. Kato +14 more
core +3 more sources
Solving challenging grid puzzles with answer set programming [PDF]
, 2007 We study four challenging grid puzzles, Nurikabe, Heyawake, Masyu, Bag Puzzle, interesting for answer set programming (ASP) from the viewpoints of representation and computation: they show expressivity of ASP, they are good examples of a ...
Erdem, Esra +5 more
core
Anytime Computation of Cautious Consequences in Answer Set Programming
, 2014 Query answering in Answer Set Programming (ASP) is usually solved by computing (a subset of) the cautious consequences of a logic program. This task is computationally very hard, and there are programs for which computing cautious consequences is not ...
Alviano, Mario +2 more
core +1 more source
Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP.
Marco De Bortoli
doaj +1 more source
Hot question prediction in Stack Overflow
IET Software, 2021 Stack Overflow is a very popular programming question and answer community. Some questions become hot, and receive high views, which are of widespread concern to developers.
Li Xian Zhao, Li Zhang, Jing Jiang
doaj +1 more source