A GENERIC APPROACH FOR SPARSE PATH PROBLEMS

Marc Pouly

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

A GENERIC APPROACH FOR SPARSE PATH PROBLEMS

Topics: Constraint Satisfaction; Expert Systems; Knowledge Representation and Reasoning

In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, 197-202, 2010 , Valencia, Spain

Author: Marc Pouly

Affiliation: Cork Constraint Computation Center, University College Cork, Ireland

Keyword(s): Sparse path problems, Valuation algebras, Local computation, Tree-decomposition methods.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Biomedical Engineering ; Constraint Satisfaction ; Expert Systems ; Health Information Systems ; Knowledge Engineering and Ontology Development ; Knowledge Representation and Reasoning ; Knowledge-Based Systems ; Symbolic Systems

Abstract: This paper shows how sparse path problems can be solved by tree-decomposition techniques. We analyse the properties of closure matrices and prove that they satisfy the axioms of a valuation algebra, which is known to be sufficient for the application of generic tree-decomposition methods. Given a sparse path problem where only a subset of queries are required, we continually compute path weights of smaller graph regions and deduce the total paths from these results. The decisive complexity factor is no more the total number of graph nodes but the induced treewidth of the path problem.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.116.10.48

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Pouly, M. (2010). A GENERIC APPROACH FOR SPARSE PATH PROBLEMS. In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-674-021-4; ISSN 2184-433X, SciTePress, pages 197-202. DOI: 10.5220/0002702701970202

@conference{icaart10,
author={Marc Pouly},
title={A GENERIC APPROACH FOR SPARSE PATH PROBLEMS},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2010},
pages={197-202},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002702701970202},
isbn={978-989-674-021-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - A GENERIC APPROACH FOR SPARSE PATH PROBLEMS
SN - 978-989-674-021-4
IS - 2184-433X
AU - Pouly, M.
PY - 2010
SP - 197
EP - 202
DO - 10.5220/0002702701970202
PB - SciTePress