Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,502 | A Wiki for Business Rules in Open Vocabulary, Executable English | cs.AI | The problem of business-IT alignment is of widespread economic concern.
As one way of addressing the problem, this paper describes an online system
that functions as a kind of Wiki -- one that supports the collaborative writing
and running of business and scientific applications, as rules in open
vocabulary, executab... | computer science |
18,503 | Teraflop-scale Incremental Machine Learning | cs.AI | We propose a long-term memory design for artificial general intelligence
based on Solomonoff's incremental machine learning methods. We use R5RS Scheme
and its standard library with a few omissions as the reference machine. We
introduce a Levin Search variant based on Stochastic Context Free Grammar
together with four ... | computer science |
18,504 | GRASP and path-relinking for Coalition Structure Generation | cs.AI | In Artificial Intelligence with Coalition Structure Generation (CSG) one
refers to those cooperative complex problems that require to find an optimal
partition, maximising a social welfare, of a set of entities involved in a
system into exhaustive and disjoint coalitions. The solution of the CSG problem
finds applicati... | computer science |
18,505 | A Directional Feature with Energy based Offline Signature Verification
Network | cs.AI | Signature used as a biometric is implemented in various systems as well as
every signature signed by each person is distinct at the same time. So, it is
very important to have a computerized signature verification system. In offline
signature verification system dynamic features are not available obviously, but
one can... | computer science |
18,506 | Planning Graph Heuristics for Belief Space Search | cs.AI | Some recent works in conditional planning have proposed reachability
heuristics to improve planner scalability, but many lack a formal description
of the properties of their distance estimates. To place previous work in
context and extend work on heuristics for conditional planning, we provide a
formal basis for distan... | computer science |
18,507 | An Artificial Immune System Model for Multi-Agents Resource Sharing in
Distributed Environments | cs.AI | Natural Immune system plays a vital role in the survival of the all living
being. It provides a mechanism to defend itself from external predates making
it consistent systems, capable of adapting itself for survival incase of
changes. The human immune system has motivated scientists and engineers for
finding powerful i... | computer science |
18,508 | SPPAM - Statistical PreProcessing AlgorithM | cs.AI | Most machine learning tools work with a single table where each row is an
instance and each column is an attribute. Each cell of the table contains an
attribute value for an instance. This representation prevents one important
form of learning, which is, classification based on groups of correlated
records, such as mul... | computer science |
18,509 | Language, Emotions, and Cultures: Emotional Sapir-Whorf Hypothesis | cs.AI | An emotional version of Sapir-Whorf hypothesis suggests that differences in
language emotionalities influence differences among cultures no less than
conceptual differences. Conceptual contents of languages and cultures to
significant extent are determined by words and their semantic differences;
these could be borrowe... | computer science |
18,510 | Reduced Ordered Binary Decision Diagram with Implied Literals: A New
knowledge Compilation Approach | cs.AI | Knowledge compilation is an approach to tackle the computational
intractability of general reasoning problems. According to this approach,
knowledge bases are converted off-line into a target compilation language which
is tractable for on-line querying. Reduced ordered binary decision diagram
(ROBDD) is one of the most... | computer science |
18,511 | Using Soft Computer Techniques on Smart Devices for Monitoring Chronic
Diseases: the CHRONIOUS case | cs.AI | CHRONIOUS is an Open, Ubiquitous and Adaptive Chronic Disease Management
Platform for Chronic Obstructive Pulmonary Disease(COPD) Chronic Kidney Disease
(CKD) and Renal Insufficiency. It consists of several modules: an ontology
based literature search engine, a rule based decision support system, remote
sensors interac... | computer science |
18,512 | Decentralized Constraint Satisfaction | cs.AI | We show that several important resource allocation problems in wireless
networks fit within the common framework of Constraint Satisfaction Problems
(CSPs). Inspired by the requirements of these applications, where variables are
located at distinct network devices that may not be able to communicate but may
interfere, ... | computer science |
18,513 | Finding Shortest Path for Developed Cognitive Map Using Medial Axis | cs.AI | this paper presents an enhancement of the medial axis algorithm to be used
for finding the optimal shortest path for developed cognitive map. The
cognitive map has been developed, based on the architectural blueprint maps.
The idea for using the medial-axis is to find main path central pixels; each
center pixel represe... | computer science |
18,514 | Extraction of handwritten areas from colored image of bank checks by an
hybrid method | cs.AI | One of the first step in the realization of an automatic system of check
recognition is the extraction of the handwritten area. We propose in this paper
an hybrid method to extract these areas. This method is based on digit
recognition by Fourier descriptors and different steps of colored image
processing . It requires... | computer science |
18,515 | Cost Based Satisficing Search Considered Harmful | cs.AI | Recently, several researchers have found that cost-based satisficing search
with A* often runs into problems. Although some "work arounds" have been
proposed to ameliorate the problem, there has not been any concerted effort to
pinpoint its origin. In this paper, we argue that the origins can be traced
back to the wide... | computer science |
18,516 | The AllDifferent Constraint with Precedences | cs.AI | We propose AllDiffPrecedence, a new global constraint that combines together
an AllDifferent constraint with precedence constraints that strictly order
given pairs of variables. We identify a number of applications for this global
constraint including instruction scheduling and symmetry breaking. We give an
efficient p... | computer science |
18,517 | A Goal-Directed Implementation of Query Answering for Hybrid MKNF
Knowledge Bases | cs.AI | Ontologies and rules are usually loosely coupled in knowledge representation
formalisms. In fact, ontologies use open-world reasoning while the leading
semantics for rules use non-monotonic, closed-world reasoning. One exception is
the tightly-coupled framework of Minimal Knowledge and Negation as Failure
(MKNF), which... | computer science |
18,518 | BoolVar/PB v1.0, a java library for translating pseudo-Boolean
constraints into CNF formulae | cs.AI | BoolVar/PB is an open source java library dedicated to the translation of
pseudo-Boolean constraints into CNF formulae. Input constraints can be
categorized with tags. Several encoding schemes are implemented in a way that
each input constraint can be translated using one or several encoders,
according to the related t... | computer science |
18,519 | On Understanding and Machine Understanding | cs.AI | In the present paper, we try to propose a self-similar network theory for the
basic understanding. By extending the natural languages to a kind of so called
idealy sufficient language, we can proceed a few steps to the investigation of
the language searching and the language understanding of AI.
Image understanding, ... | computer science |
18,520 | Splitting and Updating Hybrid Knowledge Bases (Extended Version) | cs.AI | Over the years, nonmonotonic rules have proven to be a very expressive and
useful knowledge representation paradigm. They have recently been used to
complement the expressive power of Description Logics (DLs), leading to the
study of integrative formal frameworks, generally referred to as hybrid
knowledge bases, where ... | computer science |
18,521 | Transition Systems for Model Generators - A Unifying Approach | cs.AI | A fundamental task for propositional logic is to compute models of
propositional formulas. Programs developed for this task are called
satisfiability solvers. We show that transition systems introduced by
Nieuwenhuis, Oliveras, and Tinelli to model and analyze satisfiability solvers
can be adapted for solvers developed... | computer science |
18,522 | GANC: Greedy Agglomerative Normalized Cut | cs.AI | This paper describes a graph clustering algorithm that aims to minimize the
normalized cut criterion and has a model order selection procedure. The
performance of the proposed algorithm is comparable to spectral approaches in
terms of minimizing normalized cut. However, unlike spectral approaches, the
proposed algorith... | computer science |
18,523 | Machine-Part cell formation through visual decipherable clustering of
Self Organizing Map | cs.AI | Machine-part cell formation is used in cellular manufacturing in order to
process a large variety, quality, lower work in process levels, reducing
manufacturing lead-time and customer response time while retaining flexibility
for new products. This paper presents a new and novel approach for obtaining
machine cells and... | computer science |
18,524 | Solving Rubik's Cube Using SAT Solvers | cs.AI | Rubik's Cube is an easily-understood puzzle, which is originally called the
"magic cube". It is a well-known planning problem, which has been studied for a
long time. Yet many simple properties remain unknown. This paper studies
whether modern SAT solvers are applicable to this puzzle. To our best
knowledge, we are the... | computer science |
18,525 | The Hidden Web, XML and Semantic Web: A Scientific Data Management
Perspective | cs.AI | The World Wide Web no longer consists just of HTML pages. Our work sheds
light on a number of trends on the Internet that go beyond simple Web pages.
The hidden Web provides a wealth of data in semi-structured form, accessible
through Web forms and Web services. These services, as well as numerous other
applications on... | computer science |
18,526 | A Multi-Purpose Scenario-based Simulator for Smart House Environments | cs.AI | Developing smart house systems has been a great challenge for researchers and
engineers in this area because of the high cost of implementation and
evaluation process of these systems, while being very time consuming. Testing a
designed smart house before actually building it is considered as an obstacle
towards an eff... | computer science |
18,527 | Xapagy: a cognitive architecture for narrative reasoning | cs.AI | We introduce the Xapagy cognitive architecture: a software system designed to
perform narrative reasoning. The architecture has been designed from scratch to
model and mimic the activities performed by humans when witnessing, reading,
recalling, narrating and talking about stories. | computer science |
18,528 | Probabilistic Inference from Arbitrary Uncertainty using Mixtures of
Factorized Generalized Gaussians | cs.AI | This paper presents a general and efficient framework for probabilistic
inference and learning from arbitrary uncertain information. It exploits the
calculation properties of finite mixture models, conjugate families and
factorization. Both the joint probability density of the variables and the
likelihood function of t... | computer science |
18,529 | Ontological Crises in Artificial Agents' Value Systems | cs.AI | Decision-theoretic agents predict and evaluate the results of their actions
using a model, or ontology, of their environment. An agent's goal, or utility
function, may also be specified in terms of the states of, or entities within,
its ontology. If the agent may upgrade or replace its ontology, it faces a
crisis: the ... | computer science |
18,530 | Typical models: minimizing false beliefs | cs.AI | A knowledge system S describing a part of real world does in general not
contain complete information. Reasoning with incomplete information is prone to
errors since any belief derived from S may be false in the present state of the
world. A false belief may suggest wrong decisions and lead to harmful actions.
So an im... | computer science |
18,531 | The Ariadne's Clew Algorithm | cs.AI | We present a new approach to path planning, called the "Ariadne's clew
algorithm". It is designed to find paths in high-dimensional continuous spaces
and applies to robots with many degrees of freedom in static, as well as
dynamic environments - ones where obstacles may move. The Ariadne's clew
algorithm comprises two ... | computer science |
18,532 | Computational Aspects of Reordering Plans | cs.AI | This article studies the problem of modifying the action ordering of a plan
in order to optimise the plan according to various criteria. One of these
criteria is to make a plan less constrained and the other is to minimize its
parallel execution time. Three candidate definitions are proposed for the first
of these crit... | computer science |
18,533 | The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic
Inference | cs.AI | It is common to view programs as a combination of logic and control: the
logic part defines what the program must do, the control part -- how to do it.
The Logic Programming paradigm was developed with the intention of separating
the logic from the control. Recently, extensive research has been conducted on
automatic g... | computer science |
18,534 | The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem | cs.AI | Using an improved backtrack algorithm with sophisticated pruning techniques,
we revise previous observations correlating a high frequency of hard to solve
Hamiltonian Cycle instances with the Gn,m phase transition between
Hamiltonicity and non-Hamiltonicity. Instead all tested graphs of 100 to 1500
vertices are easily ... | computer science |
18,535 | Semantic Similarity in a Taxonomy: An Information-Based Measure and its
Application to Problems of Ambiguity in Natural Language | cs.AI | This article presents a measure of semantic similarity in an IS-A taxonomy
based on the notion of shared information content. Experimental evaluation
against a benchmark set of human similarity judgments demonstrates that the
measure performs better than the traditional edge-counting approach. The
article presents algo... | computer science |
18,536 | A Temporal Description Logic for Reasoning about Actions and Plans | cs.AI | A class of interval-based temporal languages for uniformly representing and
reasoning about actions and plans is presented. Actions are represented by
describing what is true while the action itself is occurring, and plans are
constructed by temporally relating actions and world states. The temporal
languages are membe... | computer science |
18,537 | Adaptive Parallel Iterative Deepening Search | cs.AI | Many of the artificial intelligence techniques developed to date rely on
heuristic search through large spaces. Unfortunately, the size of these spaces
and the corresponding computational effort reduce the applicability of
otherwise novel and effective algorithms. A number of parallel and distributed
approaches to sear... | computer science |
18,538 | Order of Magnitude Comparisons of Distance | cs.AI | Order of magnitude reasoning - reasoning by rough comparisons of the sizes of
quantities - is often called 'back of the envelope calculation', with the
implication that the calculations are quick though approximate. This paper
exhibits an interesting class of constraint sets in which order of magnitude
reasoning is dem... | computer science |
18,539 | AntNet: Distributed Stigmergetic Control for Communications Networks | cs.AI | This paper introduces AntNet, a novel approach to the adaptive learning of
routing tables in communications networks. AntNet is a distributed, mobile
agents based Monte Carlo system that was inspired by recent work on the ant
colony metaphor for solving optimization problems. AntNet's agents concurrently
explore the ne... | computer science |
18,540 | A Counter Example to Theorems of Cox and Fine | cs.AI | Cox's well-known theorem justifying the use of probability is shown not to
hold in finite domains. The counterexample also suggests that Cox's assumptions
are insufficient to prove the result even in infinite domains. The same
counterexample is used to disprove a result of Fine on comparative conditional
probability. | computer science |
18,541 | The Automatic Inference of State Invariants in TIM | cs.AI | As planning is applied to larger and richer domains the effort involved in
constructing domain descriptions increases and becomes a significant burden on
the human application designer. If general planners are to be applied
successfully to large and complex domains it is necessary to provide the domain
designer with so... | computer science |
18,542 | Unifying Class-Based Representation Formalisms | cs.AI | The notion of class is ubiquitous in computer science and is central in many
formalisms for the representation of structured knowledge used both in
knowledge representation and in databases. In this paper we study the basic
issues underlying such representation formalisms and single out both their
common characteristic... | computer science |
18,543 | Complexity of Prioritized Default Logics | cs.AI | In default reasoning, usually not all possible ways of resolving conflicts
between default rules are acceptable. Criteria expressing acceptable ways of
resolving the conflicts may be hardwired in the inference mechanism, for
example specificity in inheritance reasoning can be handled this way, or they
may be given abst... | computer science |
18,544 | Squeaky Wheel Optimization | cs.AI | We describe a general approach to optimization which we term `Squeaky Wheel'
Optimization (SWO). In SWO, a greedy algorithm is used to construct a solution
which is then analyzed to find the trouble spots, i.e., those elements, that,
if improved, are likely to improve the objective function score. The results of
the an... | computer science |
18,545 | Variational Cumulant Expansions for Intractable Distributions | cs.AI | Intractable distributions present a common difficulty in inference within the
probabilistic knowledge representation framework and variational methods have
recently been popular in providing an approximate solution. In this article, we
describe a perturbational approach in the form of a cumulant expansion which,
to low... | computer science |
18,546 | Efficient Implementation of the Plan Graph in STAN | cs.AI | STAN is a Graphplan-based planner, so-called because it uses a variety of
STate ANalysis techniques to enhance its performance. STAN competed in the
AIPS-98 planning competition where it compared well with the other competitors
in terms of speed, finding solutions fastest to many of the problems posed.
Although the dom... | computer science |
18,547 | Cooperation between Top-Down and Bottom-Up Theorem Provers | cs.AI | Top-down and bottom-up theorem proving approaches each have specific
advantages and disadvantages. Bottom-up provers profit from strong redundancy
control but suffer from the lack of goal-orientation, whereas top-down provers
are goal-oriented but often have weak calculi when their proof lengths are
considered. In orde... | computer science |
18,548 | Solving Highly Constrained Search Problems with Quantum Computers | cs.AI | A previously developed quantum search algorithm for solving 1-SAT problems in
a single step is generalized to apply to a range of highly constrained k-SAT
problems. We identify a bound on the number of clauses in satisfiability
problems for which the generalized algorithm can find a solution in a constant
number of ste... | computer science |
18,549 | Decision-Theoretic Planning: Structural Assumptions and Computational
Leverage | cs.AI | Planning under uncertainty is a central problem in the study of automated
sequential decision making, and has been addressed by researchers in many
different fields, including AI planning, decision analysis, operations
research, control theory and economics. While the assumptions and perspectives
adopted in these areas... | computer science |
18,550 | Probabilistic Deduction with Conditional Constraints over Basic Events | cs.AI | We study the problem of probabilistic deduction with conditional constraints
over basic events. We show that globally complete probabilistic deduction with
conditional constraints over basic events is NP-hard. We then concentrate on
the special case of probabilistic deduction in conditional constraint trees. We
elabora... | computer science |
18,551 | Variational Probabilistic Inference and the QMR-DT Network | cs.AI | We describe a variational approximation method for efficient inference in
large-scale probabilistic models. Variational methods are deterministic
procedures that provide approximations to marginal and conditional
probabilities of interest. They provide alternatives to approximate inference
methods based on stochastic s... | computer science |
18,552 | Extensible Knowledge Representation: the Case of Description Reasoners | cs.AI | This paper offers an approach to extensible knowledge representation and
reasoning for a family of formalisms known as Description Logics. The approach
is based on the notion of adding new concept constructors, and includes a
heuristic methodology for specifying the desired extensions, as well as a
modularized software... | computer science |
18,553 | Constructing Conditional Plans by a Theorem-Prover | cs.AI | The research on conditional planning rejects the assumptions that there is no
uncertainty or incompleteness of knowledge with respect to the state and
changes of the system the plans operate on. Without these assumptions the
sequences of operations that achieve the goals depend on the initial state and
the outcomes of ... | computer science |
18,554 | Issues in Stacked Generalization | cs.AI | Stacked generalization is a general method of using a high-level model to
combine lower-level models to achieve greater predictive accuracy. In this
paper we address two crucial issues which have been considered to be a `black
art' in classification tasks ever since the introduction of stacked
generalization in 1992 by... | computer science |
18,555 | Ontology Alignment at the Instance and Schema Level | cs.AI | We present PARIS, an approach for the automatic alignment of ontologies.
PARIS aligns not only instances, but also relations and classes. Alignments at
the instance-level cross-fertilize with alignments at the schema-level.
Thereby, our system provides a truly holistic solution to the problem of
ontology alignment. The... | computer science |
18,556 | Complexity of and Algorithms for Borda Manipulation | cs.AI | We prove that it is NP-hard for a coalition of two manipulators to compute
how to manipulate the Borda voting rule. This resolves one of the last open
problems in the computational complexity of manipulating common voting rules.
Because of this NP-hardness, we treat computing a manipulation as an
approximation problem ... | computer science |
18,557 | Reasoning on Interval and Point-based Disjunctive Metric Constraints in
Temporal Contexts | cs.AI | We introduce a temporal model for reasoning on disjunctive metric constraints
on intervals and time points in temporal contexts. This temporal model is
composed of a labeled temporal algebra and its reasoning algorithms. The
labeled temporal algebra defines labeled disjunctive metric point-based
constraints, where each... | computer science |
18,558 | Overcoming Misleads In Logic Programs by Redefining Negation | cs.AI | Negation as failure and incomplete information in logic programs have been
studied by many researchers In order to explains HOW a negated conclusion was
reached, we introduce and proof a different way for negating facts to
overcoming misleads in logic programs. Negating facts can be achieved by asking
the user for cons... | computer science |
18,559 | Proposal of Pattern Recognition as a necessary and sufficient Principle
to Cognitive Science | cs.AI | Despite the prevalence of the Computational Theory of Mind and the
Connectionist Model, the establishing of the key principles of the Cognitive
Science are still controversy and inconclusive. This paper proposes the concept
of Pattern Recognition as Necessary and Sufficient Principle for a general
cognitive science mod... | computer science |
18,560 | The Good Old Davis-Putnam Procedure Helps Counting Models | cs.AI | As was shown recently, many important AI problems require counting the number
of models of propositional formulas. The problem of counting models of such
formulas is, according to present knowledge, computationally intractable in a
worst case. Based on the Davis-Putnam procedure, we present an algorithm, CDP,
that comp... | computer science |
18,561 | Identifying Mislabeled Training Data | cs.AI | This paper presents a new approach to identifying and eliminating mislabeled
training instances for supervised learning. The goal of this approach is to
improve classification accuracies produced by learning algorithms by improving
the quality of the training data. Our approach uses a set of learning
algorithms to crea... | computer science |
18,562 | Committee-Based Sample Selection for Probabilistic Classifiers | cs.AI | In many real-world learning tasks, it is expensive to acquire a sufficient
number of labeled examples for training. This paper investigates methods for
reducing annotation cost by `sample selection'. In this approach, during
training the learning program examines many unlabeled examples and selects for
labeling only th... | computer science |
18,563 | Reasoning about Minimal Belief and Negation as Failure | cs.AI | We investigate the problem of reasoning in the propositional fragment of
MBNF, the logic of minimal belief and negation as failure introduced by
Lifschitz, which can be considered as a unifying framework for several
nonmonotonic formalisms, including default logic, autoepistemic logic,
circumscription, epistemic querie... | computer science |
18,564 | Randomized Algorithms for the Loop Cutset Problem | cs.AI | We show how to find a minimum weight loop cutset in a Bayesian network with
high probability. Finding such a loop cutset is the first step in the method of
conditioning for inference. Our randomized algorithm for finding a loop cutset
outputs a minimum loop cutset after O(c 6^k kn) steps with probability at least
1 - (... | computer science |
18,565 | OBDD-based Universal Planning for Synchronized Agents in
Non-Deterministic Domains | cs.AI | Recently model checking representation and search techniques were shown to be
efficiently applicable to planning, in particular to non-deterministic
planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDs)
to encode a planning domain as a non-deterministic finite automaton and then
apply fast alg... | computer science |
18,566 | Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP
Search Techniques in Graphplan | cs.AI | This paper reviews the connections between Graphplan's planning-graph and the
dynamic constraint satisfaction problem and motivates the need for adapting CSP
search techniques to the Graphplan algorithm. It then describes how explanation
based learning, dependency directed backtracking, dynamic variable ordering,
forwa... | computer science |
18,567 | Space Efficiency of Propositional Knowledge Representation Formalisms | cs.AI | We investigate the space efficiency of a Propositional Knowledge
Representation (PKR) formalism. Intuitively, the space efficiency of a
formalism F in representing a certain piece of knowledge A, is the size of the
shortest formula of F that represents A. In this paper we assume that knowledge
is either a set of propos... | computer science |
18,568 | Value-Function Approximations for Partially Observable Markov Decision
Processes | cs.AI | Partially observable Markov decision processes (POMDPs) provide an elegant
mathematical framework for modeling complex decision and planning problems in
stochastic domains in which states of the system are observable only
indirectly, via a set of imperfect or noisy observations. The modeling
advantage of POMDPs, howeve... | computer science |
18,569 | On Deducing Conditional Independence from d-Separation in Causal Graphs
with Feedback (Research Note) | cs.AI | Pearl and Dechter (1996) claimed that the d-separation criterion for
conditional independence in acyclic causal networks also applies to networks of
discrete variables that have feedback cycles, provided that the variables of
the system are uniquely determined by the random disturbances. I show by
example that this is ... | computer science |
18,570 | What's in an Attribute? Consequences for the Least Common Subsumer | cs.AI | Functional relationships between objects, called `attributes', are of
considerable importance in knowledge representation languages, including
Description Logics (DLs). A study of the literature indicates that papers have
made, often implicitly, different assumptions about the nature of attributes:
whether they are alw... | computer science |
18,571 | The Complexity of Reasoning with Cardinality Restrictions and Nominals
in Expressive Description Logics | cs.AI | We study the complexity of the combination of the Description Logics ALCQ and
ALCQI with a terminological formalism based on cardinality restrictions on
concepts. These combinations can naturally be embedded into C^2, the two
variable fragment of predicate logic with counting quantifiers, which yields
decidability in N... | computer science |
18,572 | Backbone Fragility and the Local Search Cost Peak | cs.AI | The local search algorithm WSat is one of the most successful algorithms for
solving the satisfiability (SAT) problem. It is notably effective at solving
hard Random 3-SAT instances near the so-called `satisfiability threshold', but
still shows a peak in search cost near the threshold and large variations in
cost over ... | computer science |
18,573 | An Application of Reinforcement Learning to Dialogue Strategy Selection
in a Spoken Dialogue System for Email | cs.AI | This paper describes a novel method by which a spoken dialogue system can
learn to choose an optimal dialogue strategy from its experience interacting
with human users. The method is based on a combination of reinforcement
learning and performance modeling of spoken dialogue systems. The reinforcement
learning componen... | computer science |
18,574 | Nonapproximability Results for Partially Observable Markov Decision
Processes | cs.AI | We show that for several variations of partially observable Markov decision
processes, polynomial-time algorithms for finding control policies are unlikely
to or simply don't have guarantees of finding policies within a constant factor
or a constant summand of optimal. Here "unlikely" means "unless some complexity
clas... | computer science |
18,575 | On Reasonable and Forced Goal Orderings and their Use in an
Agenda-Driven Planning Algorithm | cs.AI | The paper addresses the problem of computing goal orderings, which is one of
the longstanding issues in AI planning. It makes two new contributions. First,
it formally defines and discusses two different goal orderings, which are
called the reasonable and the forced ordering. Both orderings are defined for
simple STRIP... | computer science |
18,576 | Asimovian Adaptive Agents | cs.AI | The goal of this research is to develop agents that are adaptive and
predictable and timely. At first blush, these three requirements seem
contradictory. For example, adaptation risks introducing undesirable side
effects, thereby making agents' behavior less predictable. Furthermore,
although formal verification can as... | computer science |
18,577 | A Model of Inductive Bias Learning | cs.AI | A major problem in machine learning is that of inductive bias: how to choose
a learner's hypothesis space so that it is large enough to contain a solution
to the problem being learnt, yet small enough to ensure reliable generalization
from reasonably-sized training sets. Typically such bias is supplied by hand
through ... | computer science |
18,578 | Mean Field Methods for a Special Class of Belief Networks | cs.AI | The chief aim of this paper is to propose mean-field approximations for a
broad class of Belief networks, of which sigmoid and noisy-or networks can be
seen as special cases. The approximations are based on a powerful mean-field
theory suggested by Plefka. We show that Saul, Jaakkola and Jordan' s approach
is the first... | computer science |
18,579 | On the Compilability and Expressive Power of Propositional Planning
Formalisms | cs.AI | The recent approaches of extending the GRAPHPLAN algorithm to handle more
expressive planning formalisms raise the question of what the formal meaning of
"expressive power" is. We formalize the intuition that expressive power is a
measure of how concisely planning domains and plans can be expressed in a
particular form... | computer science |
18,580 | Partial-Order Planning with Concurrent Interacting Actions | cs.AI | In order to generate plans for agents with multiple actuators, agent teams,
or distributed controllers, we must be able to represent and plan using
concurrent actions with interacting effects. This has historically been
considered a challenging task requiring a temporal planner with the ability to
reason explicitly abo... | computer science |
18,581 | Planning by Rewriting | cs.AI | Domain-independent planning is a hard combinatorial problem. Taking into
account plan quality makes the task even more difficult. This article
introduces Planning by Rewriting (PbR), a new paradigm for efficient
high-quality domain-independent planning. PbR exploits declarative
plan-rewriting rules and efficient local ... | computer science |
18,582 | Speeding Up the Convergence of Value Iteration in Partially Observable
Markov Decision Processes | cs.AI | Partially observable Markov decision processes (POMDPs) have recently become
popular among many AI researchers because they serve as a natural model for
planning under uncertainty. Value iteration is a well-known algorithm for
finding optimal policies for POMDPs. It typically takes a large number of
iterations to conve... | computer science |
18,583 | Conformant Planning via Symbolic Model Checking | cs.AI | We tackle the problem of planning in nondeterministic domains, by presenting
a new approach to conformant planning. Conformant planning is the problem of
finding a sequence of actions that is guaranteed to achieve the goal despite
the nondeterminism of the domain. Our approach is based on the representation
of the plan... | computer science |
18,584 | AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential
Reasoning in Large Bayesian Networks | cs.AI | Stochastic sampling algorithms, while an attractive alternative to exact
algorithms in very large Bayesian network models, have been observed to perform
poorly in evidential reasoning with extremely unlikely evidence. To address
this problem, we propose an adaptive importance sampling algorithm, AIS-BN,
that shows prom... | computer science |
18,585 | Conflict-Directed Backjumping Revisited | cs.AI | In recent years, many improvements to backtracking algorithms for solving
constraint satisfaction problems have been proposed. The techniques for
improving backtracking algorithms can be conveniently classified as look-ahead
schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes
are not entirely... | computer science |
18,586 | Grounding the Lexical Semantics of Verbs in Visual Perception using
Force Dynamics and Event Logic | cs.AI | This paper presents an implemented system for recognizing the occurrence of
events described by simple spatial-motion verbs in short image sequences. The
semantics of these verbs is specified with event-logic expressions that
describe changes in the state of force-dynamic relations between the
participants of the event... | computer science |
18,587 | Popular Ensemble Methods: An Empirical Study | cs.AI | An ensemble consists of a set of individually trained classifiers (such as
neural networks or decision trees) whose predictions are combined when
classifying novel instances. Previous research has shown that an ensemble is
often more accurate than any of the single classifiers in the ensemble. Bagging
(Breiman, 1996c) ... | computer science |
18,588 | An Evolutionary Algorithm with Advanced Goal and Priority Specification
for Multi-objective Optimization | cs.AI | This paper presents an evolutionary algorithm with a new goal-sequence
domination scheme for better decision support in multi-objective optimization.
The approach allows the inclusion of advanced hard/soft priority and constraint
information on each objective component, and is capable of incorporating
multiple specific... | computer science |
18,589 | The GRT Planning System: Backward Heuristic Construction in Forward
State-Space Planning | cs.AI | This paper presents GRT, a domain-independent heuristic planning system for
STRIPS worlds. GRT solves problems in two phases. In the pre-processing phase,
it estimates the distance between each fact and the goals of the problem, in a
backward direction. Then, in the search phase, these estimates are used in
order to fu... | computer science |
18,590 | The Complexity of Reasoning about Spatial Congruence | cs.AI | In the recent literature of Artificial Intelligence, an intensive research
effort has been spent, for various algebras of qualitative relations used in
the representation of temporal and spatial knowledge, on the problem of
classifying the computational complexity of reasoning problems for subsets of
algebras. The main... | computer science |
18,591 | Infinite-Horizon Policy-Gradient Estimation | cs.AI | Gradient-based approaches to direct policy search in reinforcement learning
have received much recent attention as a means to solve problems of partial
observability and to avoid some of the problems associated with policy
degradation in value-function methods. In this paper we introduce GPOMDP, a
simulation-based algo... | computer science |
18,592 | Experiments with Infinite-Horizon, Policy-Gradient Estimation | cs.AI | In this paper, we present algorithms that perform gradient ascent of the
average reward in a partially observable Markov decision process (POMDP). These
algorithms are based on GPOMDP, an algorithm introduced in a companion paper
(Baxter and Bartlett, this volume), which computes biased estimates of the
performance gra... | computer science |
18,593 | Reasoning within Fuzzy Description Logics | cs.AI | Description Logics (DLs) are suitable, well-known, logics for managing
structured knowledge. They allow reasoning about individuals and well defined
concepts, i.e., set of individuals with common properties. The experience in
using DLs in applications has shown that in many cases we would like to extend
their capabilit... | computer science |
18,594 | An Analysis of Reduced Error Pruning | cs.AI | Top-down induction of decision trees has been observed to suffer from the
inadequate functioning of the pruning phase. In particular, it is known that
the size of the resulting tree grows linearly with the sample size, even though
the accuracy of the tree does not improve. Reduced Error Pruning is an
algorithm that has... | computer science |
18,595 | GIB: Imperfect Information in a Computationally Challenging Game | cs.AI | This paper investigates the problems arising in the construction of a program
to play the game of contract bridge. These problems include both the difficulty
of solving the game's perfect information variant, and techniques needed to
address the fact that bridge is not, in fact, a perfect information game. GIB,
the pro... | computer science |
18,596 | Domain Filtering Consistencies | cs.AI | Enforcing local consistencies is one of the main features of constraint
reasoning. Which level of local consistency should be used when searching for
solutions in a constraint network is a basic question. Arc consistency and
partial forms of arc consistency have been widely studied, and have been known
for sometime thr... | computer science |
18,597 | Policy Recognition in the Abstract Hidden Markov Model | cs.AI | In this paper, we present a method for recognising an agent's behaviour in
dynamic, noisy, uncertain domains, and across multiple levels of abstraction.
We term this problem on-line plan recognition under uncertainty and view it
generally as probabilistic inference on the stochastic process representing the
execution o... | computer science |
18,598 | The FF Planning System: Fast Plan Generation Through Heuristic Search | cs.AI | We describe and evaluate the algorithmic techniques that are used in the FF
planning system. Like the HSP system, FF relies on forward state space search,
using a heuristic that estimates goal distances by ignoring delete lists.
Unlike HSP's heuristic, our method does not assume facts to be independent. We
introduce a ... | computer science |
18,599 | ATTac-2000: An Adaptive Autonomous Bidding Agent | cs.AI | The First Trading Agent Competition (TAC) was held from June 22nd to July
8th, 2000. TAC was designed to create a benchmark problem in the complex domain
of e-marketplaces and to motivate researchers to apply unique approaches to a
common task. This article describes ATTac-2000, the first-place finisher in
TAC. ATTac-2... | computer science |
18,600 | Efficient Methods for Qualitative Spatial Reasoning | cs.AI | The theoretical properties of qualitative spatial reasoning in the RCC8
framework have been analyzed extensively. However, no empirical investigation
has been made yet. Our experiments show that the adaption of the algorithms
used for qualitative temporal reasoning can solve large RCC8 instances, even if
they are in th... | computer science |
18,601 | Towards OWL-based Knowledge Representation in Petrology | cs.AI | This paper presents our work on development of OWL-driven systems for formal
representation and reasoning about terminological knowledge and facts in
petrology. The long-term aim of our project is to provide solid foundations for
a large-scale integration of various kinds of knowledge, including basic terms,
rock class... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.