Sciweavers

1144 search results - page 132 / 229
» Logic programming for combinatorial problems
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 2 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
140
Voted
ATAL
2005
Springer
15 years 8 months ago
A logic for strategic reasoning
Rational strategic reasoning is the process whereby an agent reasons about the best strategy to adopt in a given multi-agent scenario, taking into account the likely behaviour of ...
Wiebe van der Hoek, Wojciech Jamroga, Michael Wool...
109
Voted
LMCS
2007
132views more  LMCS 2007»
15 years 2 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
15 years 2 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
LPNMR
2007
Springer
15 years 8 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele