Sciweavers

8413 search results - page 109 / 1683
» Ordering Problem Subgoals
Sort
View
BIRTHDAY
2006
Springer
13 years 12 months ago
Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
Arnon Avron, Anna Zamansky
FLAIRS
2007
13 years 10 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
IJIT
2004
13 years 9 months ago
Forecasting Enrollment Model Based on First-Order Fuzzy Time Series
-- This paper proposes a novel improvement of forecasting approach based on using time-invariant fuzzy time series. In contrast to traditional forecasting methods, fuzzy time serie...
Melike Sah, Konstantin Y. Degtiarev
IJCAI
2001
13 years 9 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
IJCAI
2001
13 years 9 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...