725 search results - page 49 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
135
Voted
FUIN
2010
14 years 12 months ago
2010
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and...
101
Voted
SUM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
120
Voted
ASP
2003
Springer
15 years 7 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
106
Voted
AIR
2010
15 years 2 months ago
2010
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
114
Voted
AAAI
2006
15 years 4 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...