725 search results - page 20 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
126
click to vote
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
104
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
119
click to vote
JAIR
2008
15 years 2 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
144
click to vote
ASP
2003
Springer
15 years 7 months ago
2003
Springer
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...