Semiring induced valuation algebras: Exact and approximate local computation algorithms

&
Artificial Intelligence 172 (11):1360-1399 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2008.03.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Branch and bound algorithms to solve semiring constraint satisfaction problems.Louise Leenen & Aditya Ghose - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), PRICAI 2008: Trends in Artificial Intelligence. Springer. pp. 991--997.
Point algebras for temporal reasoning: Algorithms and complexity.Mathias Broxvall & Peter Jonsson - 2003 - Artificial Intelligence 149 (2):179-220.
Towards an analytic framework for analysing the computation time of evolutionary algorithms.Jun He & Xin Yao - 2003 - Artificial Intelligence 145 (1-2):59-97.
Optimizing the computation of overriding in DL N.P. A. Bonatti, I. M. Petrova & L. Sauro - 2022 - Artificial Intelligence 311 (C):103764.
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT.Holger H. Hoos & Thomas Stützle - 1999 - Artificial Intelligence 112 (1-2):213-232.
A k-additive Choquet integral-based approach to approximate the SHAP values for local interpretability in machine learning.Guilherme Dean Pelegrina, Leonardo Tomazeli Duarte & Michel Grabisch - 2023 - Artificial Intelligence 325 (C):104014.
Consciousness, computation, and the chinese room.Roger Penrose - 2002 - In John Mark Bishop & John Preston (eds.), Views Into the Chinese Room: New Essays on Searle and Artificial Intelligence. London: Oxford University Press.
Approximate planning.Matthew L. Ginsberg - 1995 - Artificial Intelligence 76 (1-2):89-123.
Artificial Intelligence and Symbolic Mathematical Computation: International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings.Jaques Calmet & Jochen Pfalzgraf - 1996 - Springer Verlag.
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,281,906)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
Arc consistency for soft constraints.Martin Cooper & Thomas Schiex - 2004 - Artificial Intelligence 154 (1-2):199-227.
Theories of causal ordering.Johan de Kleer & John Seely Brown - 1986 - Artificial Intelligence 29 (1):33-61.

View all 6 references / Add more references