Search Sciweavers | Sciweavers

63

IPL
2006

97views more IPL 2006»

A fixed-parameter tractability result for multicommodity demand flow in trees

14 years 9 months ago

We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...

Jiong Guo, Rolf Niedermeier

claim paper

Read More »

85

click to vote

IJCAI
2003

130views Artificial Intelligence» more IJCAI 2003»

Temporal Reasoning with Preferences and Uncertainty

14 years 10 months ago

Download staff.aub.edu.lb

Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...

Neil Yorke-Smith, Kristen Brent Venable, Francesca...

claim paper

Read More »

79

click to vote

AUSAI
1999
Springer

107views Artificial Intelligence» more AUSAI 1999»

Feasibility of Optimised Disjunctive Reasoning for Approximate Matching

15 years 1 months ago

Download www.comlab.ox.ac.uk

Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classiﬁcation reasoning. However recognition of in...

Ian Horrocks, Lin Padgham, Laura Thomson

claim paper

Read More »

54

click to vote

LICS
2007
IEEE

76views Automated Reasoning» more LICS 2007»

Tractability and learnability arising from algebras with few subpowers

15 years 3 months ago

Download www.math.vanderbilt.edu

A k-edge operation ϕ on a ﬁnite set A is a k + 1-ary operation that satisﬁes the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....

Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...

claim paper

Read More »

60

click to vote

TIME
1994
IEEE

149views Automated Reasoning» more TIME 1994»

An Application-independent Support System for Integrated Assumption-based Temporal Reasoning

15 years 1 months ago