Sciweavers

5506 search results - page 124 / 1102
» Minimal Logic Programs
Sort
View
KR
2004
Springer
15 years 8 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
ICDCS
2003
IEEE
15 years 8 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
15 years 7 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
ICLP
2009
Springer
16 years 4 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin
SUM
2009
Springer
15 years 9 months ago
Query Answering in Belief Logic Programming
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...
Hui Wan, Michael Kifer