Journal of Logic and Computation
Papers 1457
1 page of 146 pages (1,457 results)
#1Ivan ChajdaH-Index: 12
#2Davide Fazio (University of Cagliari)H-Index: 1
Last. Antonio Ledda (University of Cagliari)H-Index: 20
view all 3 authors...
#1Wolfgang Dvořák (TU Wien: Vienna University of Technology)H-Index: 16
#2Anna Rapberger (TU Wien: Vienna University of Technology)
Last. Stefan Woltran (TU Wien: Vienna University of Technology)H-Index: 29
view all 3 authors...
#1Michael Abseher (TU Wien: Vienna University of Technology)H-Index: 5
#2Bernhard Bliem (TU Wien: Vienna University of Technology)H-Index: 6
Last. Stefan Woltran (TU Wien: Vienna University of Technology)H-Index: 29
view all 5 authors...
Problems from the area of graph theory always served as fruitful benchmarks in order to explore the performance of Answer Set Programming (ASP) systems. A relatively new branch in graph theory is concerned with so-called secure sets. It is known that verifying whether a set is secure in a graph is already co-NP-hard. The problem of enumerating all secure sets thus is challenging for ASP and its systems. In particular, encodings for this problem seem to require disjunction and also recursive aggr...
8 CitationsSource
#1Martin GebserH-Index: 32
#2Tomi JanhunenH-Index: 21
Last. Jussi RintanenH-Index: 23
view all 3 authors...
Many knowledge representation tasks involve trees or similar structures as abstract datatypes. However, devising compact and efficient declarative representations of such structural properties is non-obvious and can be challenging indeed. In this paper, we take a number of acyclicity properties into consideration and investigate various logic-based approaches to encode them. We use answer set programming as the primary representation language but also consider mappings to related formalisms, suc...
#1Mario Alviano (University of Calabria)H-Index: 17
#2Carmine Dodaro (University of Calabria)H-Index: 12
Last. Francesco Ricca (University of Calabria)H-Index: 23
view all 4 authors...
18 CitationsSource
#1Joseph Babb (ASU: Arizona State University)H-Index: 4
#2Joohyung Lee (ASU: Arizona State University)H-Index: 21
Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high level notations of answer set programs structured to represent transition systems. However, the form of answer set programs considered in the earlier work is quite limited in comparison with the modern Answer Set Programming (ASP) language, which allows several useful constructs for knowledge representation, such as choice rules, aggregat...
6 CitationsSource
#1Patrick Kahl (TTU: Texas Tech University)H-Index: 1
#2Richard Watson (TTU: Texas Tech University)H-Index: 7
Last. Yuanlin Zhang (TTU: Texas Tech University)H-Index: 15
view all 5 authors...
19 CitationsSource
#1Marcelo E. Coniglio (State University of Campinas)H-Index: 14
#2Aldo Figallo-Orellano (UNS: Universidad Nacional del Sur)H-Index: 2
Last. Ana C. Golzio (UNESP: Sao Paulo State University)H-Index: 2
view all 3 authors...
1 CitationsSource
#1Nicolas Troquard (Free University of Bozen-Bolzano)H-Index: 12
Research in multiagent systems is advancing and one can predict its future widespread implementation in real-world systems. One needs however to acknowledge that the agents evolving in the real world have limited access to resources. They have to seek after resource objectives and compete for those resources. We introduce a class of resource games where resources and preferences are described with the language of a resource-sensitive logic. We study three decision problems, the first of which is...
Top fields of study
Discrete mathematics
Dynamic logic (modal logic)
Computer science