Sciweavers

ICLP
2009
Springer
14 years 5 months ago
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
Henning Christiansen, Ole Torp Lassen
ICLP
2009
Springer
14 years 5 months ago
Metabolic Network Expansion with Answer Set Programming
Abstract. We propose a qualitative approach to elaborating the biosynthetic capacities of metabolic networks. In fact, large-scale metabolic networks as well as measured datasets s...
Torsten Schaub, Sven Thiele
ICLP
2009
Springer
14 years 5 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
ICLP
2009
Springer
14 years 5 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
ICLP
2009
Springer
14 years 5 months ago
Logic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
Carroline Dewi Puspa Kencana Ramli, Steffen Hö...
ICLP
2009
Springer
14 years 5 months ago
Demand-Driven Normalisation for ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Leslie De Koninck, Gregory J. Duck, Peter J. Stuck...
ICLP
2009
Springer
14 years 5 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
ICLP
2009
Springer
14 years 5 months ago
Research Summary
Jianmin Ji