|
1-10 of 16 reviews |
Date Reviewed | |
|
Algorithms for computing backbones of propositional formulae Janota M., Lynce I., Marques-Silva J. AI Communications 28(2): 161-177, 2015. Type: Article
The backbone (also called “necessary variables” or “fixed assignments”) of a propositional formula φ is the set of literals that are true in all models of the formula. Put another way, t...
|
Oct 27 2016 |
|
|
Monotonic qualitative logic programs: computation and applications Ben-Eliyahu-Zohary R., Grinshpoun T., Churkin E., Gudes E. AI Communications 27(3): 213-228, 2014. Type: Article
If we are reasoning with rules that are guidelines rather than absolute statements of truth, we need a mechanism for selecting the most plausible conclusion. There may be a choice of rules that can be applied in some situations, and us...
|
May 5 2015 |
|
|
Robotics and artificial intelligence: a perspective on deliberation functions Ingrand F., Ghallab M. AI Communications 27(1): 63-80, 2014. Type: Article
In the authors’ words, in this short review paper, deliberation functions concern “purposeful, chosen or planned actions [understood both algorithmically and through actuators], carried out in order to achieve some ...
|
Sep 12 2014 |
|
|
On the current paradigm in artificial intelligence Cristianini N. AI Communications 27(1): 37-43, 2014. Type: Article
This is an interesting and engaging paper for those who take a serious interest in artificial intelligence (AI), who likely will set the propositions from this paper about the current dominant topics in AI against their own experiences...
|
May 30 2014 |
|
|
Restricting backtracking in connection calculi Otten J. AI Communications 23(2-3): 159-182, 2010. Type: Article
Theorem provers based on connection calculi use a goal-oriented proof search, but in practice this simplicity is marred by a need for extensive backtracking....
|
Nov 11 2010 |
|
|
COCONF: conceptual language-based configuration Magro D. AI Communications 23(1): 1-46, 2010. Type: Article
The configuration problem is a classic problem in constraint satisfaction, with a history that goes back at least as far as R1 and Xcon, the rule-based systems for configuring Vaxen. Today, there are many configurators on the Web...
|
Nov 5 2010 |
|
|
Practical algorithms for unsatisfiability proof and core generation in SAT solvers Asín Achá R., Nieuwenhuis R., Oliveras A., Rodríguez-Carbonell E. AI Communications 23(2-3): 145-157, 2010. Type: Article
Boolean satisfiability (SAT), a nondeterministic polynomial-time (NP) complete problem, deals with determining whether a given set of Boolean propositions can evaluate to a true value, by choosing an appropriate assignment to their con...
|
Aug 11 2010 |
|
|
Heuristics for dynamically adapting propagation in constraint satisfaction problems Stergiou K. AI Communications 22(3): 125-141, 2009. Type: Article
Assume a set of variables pulling values from respective domains and a set of constraints they are supposed to satisfy, and you have a constraint satisfaction problem (CSP). Solving CSPs is not as easy as defining them. Due to the gene...
|
Nov 18 2009 |
|
|
A multilayer ontology-based hybrid recommendation model Cantador I., Bellogín A., Castells P. AI Communications 21(2-3): 203-210, 2008. Type: Article
Recommender systems--where products, services, and even people can be recommended based on some behind-the-scenes computation--are quite well established as an interesting and sometimes complex area of computer scienc...
|
Feb 13 2009 |
|
|
Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment Mouhoub M. AI Communications 17(4): 201-211, 2004. Type: Article
Artificial Intelligence has matured to the point that it is proving useful in many real-world applications. Planning and scheduling in dynamic environments is one such domain. Imagine a robot navigating through a university full of stu...
|
Jan 12 2006 |
|
|
|
|
|
|
|
|