Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,602 | Accelerating Reinforcement Learning by Composing Solutions of
Automatically Identified Subtasks | cs.AI | This paper discusses a system that accelerates reinforcement learning by
using transfer from related tasks. Without such transfer, even if two tasks are
very similar at some abstract level, an extensive re-learning effort is
required. The system achieves much of its power by transferring parts of
previously learned sol... | computer science |
18,603 | Parameter Learning of Logic Programs for Symbolic-Statistical Modeling | cs.AI | We propose a logical/mathematical framework for statistical parameter
learning of parameterized logic programs, i.e. definite clause programs
containing probabilistic facts with a parameterized distribution. It extends
the traditional least Herbrand model semantics in logic programming to
distribution semantics, possib... | computer science |
18,604 | Finding a Path is Harder than Finding a Tree | cs.AI | I consider the problem of learning an optimal path graphical model from data
and show the problem to be NP-hard for the maximum likelihood and minimum
description length approaches and a Bayesian approach. This hardness result
holds despite the fact that the problem is a restriction of the polynomially
solvable problem... | computer science |
18,605 | Extensions of Simple Conceptual Graphs: the Complexity of Rules and
Constraints | cs.AI | Simple conceptual graphs are considered as the kernel of most knowledge
representation formalisms built upon Sowa's model. Reasoning in this model can
be expressed by a graph homomorphism called projection, whose semantics is
usually given in terms of positive, conjunctive, existential FOL. We present
here a family of ... | computer science |
18,606 | Fusions of Description Logics and Abstract Description Systems | cs.AI | Fusions are a simple way of combining logics. For normal modal logics,
fusions have been investigated in detail. In particular, it is known that,
under certain conditions, decidability transfers from the component logics to
their fusion. Though description logics are closely related to modal logics,
they are not necess... | computer science |
18,607 | Improving the Efficiency of Inductive Logic Programming Through the Use
of Query Packs | cs.AI | Inductive logic programming, or relational learning, is a powerful paradigm
for machine learning or data mining. However, in order for ILP to become
practically useful, the efficiency of ILP systems must improve substantially.
To this end, the notion of a query pack is introduced: it structures sets of
similar queries.... | computer science |
18,608 | A Critical Assessment of Benchmark Comparison in Planning | cs.AI | Recent trends in planning research have led to empirical comparison becoming
commonplace. The field has started to settle into a methodology for such
comparisons, which for obvious practical reasons requires running a subset of
planners on a subset of problems. In this paper, we characterize the
methodology and examine... | computer science |
18,609 | SMOTE: Synthetic Minority Over-sampling Technique | cs.AI | An approach to the construction of classifiers from imbalanced datasets is
described. A dataset is imbalanced if the classification categories are not
approximately equally represented. Often real-world data sets are predominately
composed of "normal" examples with only a small percentage of "abnormal" or
"interesting"... | computer science |
18,610 | When do Numbers Really Matter? | cs.AI | Common wisdom has it that small distinctions in the probabilities
(parameters) quantifying a belief network do not matter much for the results of
probabilistic queries. Yet, one can develop realistic scenarios under which
small variations in network parameters can lead to significant changes in
computed queries. A pend... | computer science |
18,611 | Monitoring Teams by Overhearing: A Multi-Agent Plan-Recognition Approach | cs.AI | Recent years are seeing an increasing need for on-line monitoring of teams of
cooperating agents, e.g., for visualization, or performance tracking. However,
in monitoring deployed teams, we often cannot rely on the agents to always
communicate their state to the monitoring system. This paper presents a
non-intrusive ap... | computer science |
18,612 | Automatically Training a Problematic Dialogue Predictor for a Spoken
Dialogue System | cs.AI | Spoken dialogue systems promise efficient and natural access to a large
variety of information sources and services from any phone. However, current
spoken dialogue systems are deficient in their strategies for preventing,
identifying and repairing problems that arise in the conversation. This paper
reports results on ... | computer science |
18,613 | Inducing Interpretable Voting Classifiers without Trading Accuracy for
Simplicity: Theoretical Results, Approximation Algorithms | cs.AI | Recent advances in the study of voting classification algorithms have brought
empirical and theoretical results clearly showing the discrimination power of
ensemble classifiers. It has been previously argued that the search of this
classification power in the design of the algorithms has marginalized the need
to obtain... | computer science |
18,614 | A Knowledge Compilation Map | cs.AI | We propose a perspective on knowledge compilation which calls for analyzing
different compilation approaches according to two key dimensions: the
succinctness of the target compilation language, and the class of queries and
transformations that the language supports in polytime. We then provide a
knowledge compilation ... | computer science |
18,615 | Inferring Strategies for Sentence Ordering in Multidocument News
Summarization | cs.AI | The problem of organizing information for multidocument summarization so that
the generated summary is coherent has received relatively little attention.
While sentence ordering for single document summarization can be determined
from the ordering of sentences in the input article, this is not the case for
multidocumen... | computer science |
18,616 | Collective Intelligence, Data Routing and Braess' Paradox | cs.AI | We consider the problem of designing the the utility functions of the
utility-maximizing agents in a multi-agent system so that they work
synergistically to maximize a global utility. The particular problem domain we
explore is the control of network routing by placing agents on all the routers
in the network. Conventi... | computer science |
18,617 | Efficient Solution Algorithms for Factored MDPs | cs.AI | This paper addresses the problem of planning under uncertainty in large
Markov Decision Processes (MDPs). Factored MDPs represent a complex state space
using state variables and the transition model using a dynamic Bayesian
network. This representation often allows an exponential reduction in the
representation size of... | computer science |
18,618 | Intelligent decision: towards interpreting the Pe Algorithm | cs.AI | The human intelligence lies in the algorithm, the nature of algorithm lies in
the classification, and the classification is equal to outlier detection. A lot
of algorithms have been proposed to detect outliers, meanwhile a lot of
definitions. Unsatisfying point is that definitions seem vague, which makes the
solution a... | computer science |
18,619 | A Linear Time Natural Evolution Strategy for Non-Separable Functions | cs.AI | We present a novel Natural Evolution Strategy (NES) variant, the Rank-One NES
(R1-NES), which uses a low rank approximation of the search distribution
covariance matrix. The algorithm allows computation of the natural gradient
with cost linear in the dimensionality of the parameter space, and excels in
solving high-dim... | computer science |
18,620 | From Causal Models To Counterfactual Structures | cs.AI | Galles and Pearl claimed that "for recursive models, the causal model
framework does not add any restrictions to counterfactuals, beyond those
imposed by Lewis's [possible-worlds] framework." This claim is examined
carefully, with the goal of clarifying the exact relationship between causal
models and Lewis's framework... | computer science |
18,621 | Actual causation and the art of modeling | cs.AI | We look more carefully at the modeling of causality using structural
equations. It is clear that the structural equations can have a major impact on
the conclusions we draw about causality. In particular, the choice of variables
and their values can also have a significant impact on causality. These choices
are, to som... | computer science |
18,622 | Generating Schemata of Resolution Proofs | cs.AI | Two distinct algorithms are presented to extract (schemata of) resolution
proofs from closed tableaux for propositional schemata. The first one handles
the most efficient version of the tableau calculus but generates very complex
derivations (denoted by rather elaborate rewrite systems). The second one has
the advantag... | computer science |
18,623 | Random forest models of the retention constants in the thin layer
chromatography | cs.AI | In the current study we examine an application of the machine learning
methods to model the retention constants in the thin layer chromatography
(TLC). This problem can be described with hundreds or even thousands of
descriptors relevant to various molecular properties, most of them redundant
and not relevant for the r... | computer science |
18,624 | Uncertainty in Ontologies: Dempster-Shafer Theory for Data Fusion
Applications | cs.AI | Nowadays ontologies present a growing interest in Data Fusion applications.
As a matter of fact, the ontologies are seen as a semantic tool for describing
and reasoning about sensor data, objects, relations and general domain
theories. In addition, uncertainty is perhaps one of the most important
characteristics of the... | computer science |
18,625 | Coincidences and the encounter problem: A formal account | cs.AI | Individuals have an intuitive perception of what makes a good coincidence.
Though the sensitivity to coincidences has often been presented as resulting
from an erroneous assessment of probability, it appears to be a genuine
competence, based on non-trivial computations. The model presented here
suggests that coincidenc... | computer science |
18,626 | Rooting opinions in the minds: a cognitive model and a formal account of
opinions and their dynamics | cs.AI | The study of opinions, their formation and change, is one of the defining
topics addressed by social psychology, but in recent years other disciplines,
like computer science and complexity, have tried to deal with this issue.
Despite the flourishing of different models and theories in both fields,
several key questions... | computer science |
18,627 | Understanding opinions. A cognitive and formal account | cs.AI | The study of opinions, their formation and change, is one of the defining
topics addressed by social psychology, but in recent years other disciplines,
as computer science and complexity, have addressed this challenge. Despite the
flourishing of different models and theories in both fields, several key
questions still ... | computer science |
18,628 | Learning When Training Data are Costly: The Effect of Class Distribution
on Tree Induction | cs.AI | For large, real-world inductive learning problems, the number of training
examples often must be limited due to the costs associated with procuring,
preparing, and storing the training examples and/or the computational costs
associated with learning from them. In such circumstances, one question of
practical importance... | computer science |
18,629 | PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains | cs.AI | In recent years research in the planning community has moved increasingly
toward s application of planners to realistic problems involving both time and
many typ es of resources. For example, interest in planning demonstrated by the
space res earch community has inspired work in observation scheduling,
planetary rover ... | computer science |
18,630 | The Communicative Multiagent Team Decision Problem: Analyzing Teamwork
Theories and Models | cs.AI | Despite the significant progress in multiagent teamwork, existing research
does not address the optimality of its prescriptions nor the complexity of the
teamwork problem. Without a characterization of the optimality-complexity
tradeoffs, it is impossible to determine whether the assumptions and
approximations made by ... | computer science |
18,631 | Towards Adjustable Autonomy for the Real World | cs.AI | Adjustable autonomy refers to entities dynamically varying their own
autonomy, transferring decision-making control to other entities (typically
agents transferring control to human users) in key situations. Determining
whether and when such transfers-of-control should occur is arguably the
fundamental research problem... | computer science |
18,632 | An Analysis of Phase Transition in NK Landscapes | cs.AI | In this paper, we analyze the decision version of the NK landscape model from
the perspective of threshold phenomena and phase transitions under two random
distributions, the uniform probability model and the fixed ratio model. For the
uniform probability model, we prove that the phase transition is easy in the
sense t... | computer science |
18,633 | Expert-Guided Subgroup Discovery: Methodology and Application | cs.AI | This paper presents an approach to expert-guided subgroup discovery. The main
step of the subgroup discovery process, the induction of subgroup descriptions,
is performed by a heuristic beam search algorithm, using a novel parametrized
definition of rule quality which is analyzed in detail. The other important
steps of... | computer science |
18,634 | Propositional Independence - Formula-Variable Independence and
Forgetting | cs.AI | Independence -- the study of what is relevant to a given problem of reasoning
-- has received an increasing attention from the AI community. In this paper,
we consider two basic forms of independence, namely, a syntactic one and a
semantic one. We show features and drawbacks of them. In particular, while the
syntactic ... | computer science |
18,635 | Monte Carlo Methods for Tempo Tracking and Rhythm Quantization | cs.AI | We present a probabilistic generative model for timing deviations in
expressive music performance. The structure of the proposed model is equivalent
to a switching state space model. The switch variables correspond to discrete
note locations as in a musical score. The continuous hidden variables denote
the tempo. We fo... | computer science |
18,636 | Exploiting Contextual Independence In Probabilistic Inference | cs.AI | Bayesian belief networks have grown to prominence because they provide
compact representations for many problems for which probabilistic inference is
appropriate, and there are algorithms to exploit this compactness. The next
step is to allow compact representations of the conditional probabilities of a
variable given ... | computer science |
18,637 | Bound Propagation | cs.AI | In this article we present an algorithm to compute bounds on the marginals of
a graphical model. For several small clusters of nodes upper and lower bounds
on the marginal values are computed independently of the rest of the network.
The range of allowed probability distributions over the surrounding nodes is
restricte... | computer science |
18,638 | On Polynomial Sized MDP Succinct Policies | cs.AI | Policies of Markov Decision Processes (MDPs) determine the next action to
execute from the current state and, possibly, the history (the past states).
When the number of states is large, succinct representations are often used to
compactly represent both the MDPs and the policies in a reduced amount of
space. In this p... | computer science |
18,639 | Compiling Causal Theories to Successor State Axioms and STRIPS-Like
Systems | cs.AI | We describe a system for specifying the effects of actions. Unlike those
commonly used in AI planning, our system uses an action description language
that allows one to specify the effects of actions using domain rules, which are
state constraints that can entail new action effects from old ones.
Declaratively, an acti... | computer science |
18,640 | VHPOP: Versatile Heuristic Partial Order Planner | cs.AI | VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP.
It draws from the experience gained in the early to mid 1990's on flaw
selection strategies for POCL planning, and combines this with more recent
developments in the field of domain independent planning such as distance based
heuristics and rea... | computer science |
18,641 | SHOP2: An HTN Planning System | cs.AI | The SHOP2 planning system received one of the awards for distinguished
performance in the 2002 International Planning Competition. This paper
describes the features of SHOP2 which enabled it to excel in the competition,
especially those aspects of SHOP2 that deal with temporal and metric planning
domains. | computer science |
18,642 | An Architectural Approach to Ensuring Consistency in Hierarchical
Execution | cs.AI | Hierarchical task decomposition is a method used in many agent systems to
organize agent knowledge. This work shows how the combination of a hierarchy
and persistent assertions of knowledge can lead to difficulty in maintaining
logical consistency in asserted knowledge. We explore the problematic
consequences of persis... | computer science |
18,643 | Wrapper Maintenance: A Machine Learning Approach | cs.AI | The proliferation of online information sources has led to an increased use
of wrappers for extracting data from Web sources. While most of the previous
research has focused on quick and efficient generation of wrappers, the
development of tools for wrapper maintenance has received less attention. This
is an important ... | computer science |
18,644 | Exploiting Reputation in Distributed Virtual Environments | cs.AI | The cognitive research on reputation has shown several interesting properties
that can improve both the quality of services and the security in distributed
electronic environments. In this paper, the impact of reputation on
decision-making under scarcity of information will be shown. First, a cognitive
theory of reputa... | computer science |
18,645 | The All Relevant Feature Selection using Random Forest | cs.AI | In this paper we examine the application of the random forest classifier for
the all relevant feature selection problem. To this end we first examine two
recently proposed all relevant feature selection algorithms, both being a
random forest wrappers, on a series of synthetic data sets with varying size.
We show that r... | computer science |
18,646 | Structure and Complexity in Planning with Unary Operators | cs.AI | Unary operator domains -- i.e., domains in which operators have a single
effect -- arise naturally in many control problems. In its most general form,
the problem of STRIPS planning in unary operator domains is known to be as hard
as the general STRIPS planning problem -- both are PSPACE-complete. However,
unary operat... | computer science |
18,647 | Answer Set Planning Under Action Costs | cs.AI | Recently, planning based on answer set programming has been proposed as an
approach towards realizing declarative planning systems. In this paper, we
present the language Kc, which extends the declarative planning language K by
action costs. Kc provides the notion of admissible and optimal plans, which are
plans whose ... | computer science |
18,648 | Learning to Coordinate Efficiently: A Model-based Approach | cs.AI | In common-interest stochastic games all players receive an identical payoff.
Players participating in such games must learn to coordinate with each other in
order to receive the highest-possible value. A number of reinforcement learning
algorithms have been proposed for this problem, and some have been shown to
converg... | computer science |
18,649 | SAPA: A Multi-objective Metric Temporal Planner | cs.AI | SAPA is a domain-independent heuristic forward chaining planner that can
handle durative actions, metric resource constraints, and deadline goals. It is
designed to be capable of handling the multi-objective nature of metric
temporal planning. Our technical contributions include (i) planning-graph based
methods for der... | computer science |
18,650 | A New General Method to Generate Random Modal Formulae for Testing
Decision Procedures | cs.AI | The recent emergence of heavily-optimized modal decision procedures has
highlighted the key role of empirical testing in this domain. Unfortunately,
the introduction of extensive empirical tests for modal logics is recent, and
so far none of the proposed test generators is very satisfactory. To cope with
this fact, we ... | computer science |
18,651 | AltAltp: Online Parallelization of Plans with Heuristic State Search | cs.AI | Despite their near dominance, heuristic state search planners still lag
behind disjunctive planners in the generation of parallel plans in classical
planning. The reason is that directly searching for parallel solutions in state
space planners would require the planners to branch on all possible subsets of
parallel act... | computer science |
18,652 | New Polynomial Classes for Logic-Based Abduction | cs.AI | We address the problem of propositional logic-based abduction, i.e., the
problem of searching for a best explanation for a given propositional
observation according to a given propositional knowledge base. We give a
general algorithm, based on the notion of projection; then we study
restrictions over the representation... | computer science |
18,653 | Planning Through Stochastic Local Search and Temporal Action Graphs in
LPG | cs.AI | We present some techniques for planning in domains specified with the recent
standard language PDDL2.1, supporting 'durative actions' and numerical
quantities. These techniques are implemented in LPG, a domain-independent
planner that took part in the 3rd International Planning Competition (IPC). LPG
is an incremental,... | computer science |
18,654 | TALplanner in IPC-2002: Extensions and Control Rules | cs.AI | TALplanner is a forward-chaining planner that relies on domain knowledge in
the shape of temporal logic formulas in order to prune irrelevant parts of the
search space. TALplanner recently participated in the third International
Planning Competition, which had a clear emphasis on increasing the complexity
of the proble... | computer science |
18,655 | Temporal Decision Trees: Model-based Diagnosis of Dynamic Systems
On-Board | cs.AI | The automatic generation of decision trees based on off-line reasoning on
models of a domain is a reasonable compromise between the advantages of using a
model-based approach in technical domains and the constraints imposed by
embedded applications. In this paper we extend the approach to deal with
temporal information... | computer science |
18,656 | Optimal Schedules for Parallelizing Anytime Algorithms: The Case of
Shared Resources | cs.AI | The performance of anytime algorithms can be improved by simultaneously
solving several instances of algorithm-problem pairs. These pairs may include
different instances of a problem (such as starting from a different initial
state), different algorithms (if several alternatives exist), or several runs
of the same algo... | computer science |
18,657 | Decision-Theoretic Bidding Based on Learned Density Models in
Simultaneous, Interacting Auctions | cs.AI | Auctions are becoming an increasingly popular method for transacting
business, especially over the Internet. This article presents a general
approach to building autonomous bidding agents to bid in multiple simultaneous
auctions for interacting goods. A core component of our approach learns a model
of the empirical pri... | computer science |
18,658 | The Metric-FF Planning System: Translating "Ignoring Delete Lists" to
Numeric State Variables | cs.AI | Planning with numeric state variables has been a challenge for many years,
and was a part of the 3rd International Planning Competition (IPC-3). Currently
one of the most popular and successful algorithmic techniques in STRIPS
planning is to guide search by a heuristic function, where the heuristic is
based on relaxing... | computer science |
18,659 | Manipulation of Nanson's and Baldwin's Rules | cs.AI | Nanson's and Baldwin's voting rules select a winner by successively
eliminating candidates with low Borda scores. We show that these rules have a
number of desirable computational properties. In particular, with unweighted
votes, it is NP-hard to manipulate either rule with one manipulator, whilst
with weighted votes, ... | computer science |
18,660 | Theory and Algorithms for Partial Order Based Reduction in Planning | cs.AI | Search is a major technique for planning. It amounts to exploring a state
space of planning domains typically modeled as a directed graph. However,
prohibitively large sizes of the search space make search expensive. Developing
better heuristic functions has been the main technique for improving search
efficiency. Neve... | computer science |
18,661 | A Comparison of Lex Bounds for Multiset Variables in Constraint
Programming | cs.AI | Set and multiset variables in constraint programming have typically been
represented using subset bounds. However, this is a weak representation that
neglects potentially useful information about a set such as its cardinality.
For set variables, the length-lex (LL) representation successfully provides
information about... | computer science |
18,662 | The 3rd International Planning Competition: Results and Analysis | cs.AI | This paper reports the outcome of the third in the series of biennial
international planning competitions, held in association with the International
Conference on AI Planning and Scheduling (AIPS) in 2002. In addition to
describing the domains, the planners and the objectives of the competition, the
paper includes ana... | computer science |
18,663 | Use of Markov Chains to Design an Agent Bidding Strategy for Continuous
Double Auctions | cs.AI | As computational agents are developed for increasingly complicated e-commerce
applications, the complexity of the decisions they face demands advances in
artificial intelligence techniques. For example, an agent representing a seller
in an auction should try to maximize the seller's profit by reasoning about a
variety ... | computer science |
18,664 | Reasoning in the OWL 2 Full Ontology Language using First-Order
Automated Theorem Proving | cs.AI | OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a
family of ontology languages for the Semantic Web. The most expressive of these
languages is OWL 2 Full, but to date no reasoner has been implemented for this
language. Consistency and entailment checking are known to be undecidable for
OWL 2 Full.... | computer science |
18,665 | 'Just Enough' Ontology Engineering | cs.AI | This paper introduces 'just enough' principles and 'systems engineering'
approach to the practice of ontology development to provide a minimal yet
complete, lightweight, agile and integrated development process, supportive of
stakeholder management and implementation independence. | computer science |
18,666 | Conscious Machines and Consciousness Oriented Programming | cs.AI | In this paper, we investigate the following question: how could you write
such computer programs that can work like conscious beings? The motivation
behind this question is that we want to create such applications that can see
the future. The aim of this paper is to provide an overall conceptual framework
for this new ... | computer science |
18,667 | A First Approach on Modelling Staff Proactiveness in Retail Simulation
Models | cs.AI | There has been a noticeable shift in the relative composition of the industry
in the developed countries in recent years; manufacturing is decreasing while
the service sector is becoming more important. However, currently most
simulation models for investigating service systems are still built in the same
way as manufa... | computer science |
18,668 | Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good
One, Too | cs.AI | A fact apparently not observed earlier in the literature of nonmonotonic
reasoning is that Reiter, in his default logic paper, did not directly
formalize informal defaults. Instead, he translated a default into a certain
natural language proposition and provided a formalization of the latter. A few
years later, Moore n... | computer science |
18,669 | Revisiting Epistemic Specifications | cs.AI | In 1991, Michael Gelfond introduced the language of epistemic specifications.
The goal was to develop tools for modeling problems that require some form of
meta-reasoning, that is, reasoning over multiple possible worlds. Despite their
relevance to knowledge representation, epistemic specifications have received
relati... | computer science |
18,670 | Origins of Answer-Set Programming - Some Background And Two Personal
Accounts | cs.AI | We discuss the evolution of aspects of nonmonotonic reasoning towards the
computational paradigm of answer-set programming (ASP). We give a general
overview of the roots of ASP and follow up with the personal perspective on
research developments that helped verbalize the main principles of ASP and
differentiated it fro... | computer science |
18,671 | Doing Better Than UCT: Rational Monte Carlo Sampling in Trees | cs.AI | UCT, a state-of-the art algorithm for Monte Carlo tree sampling (MCTS), is
based on UCB, a sampling policy for the Multi-armed Bandit Problem (MAB) that
minimizes the accumulated regret. However, MCTS differs from MAB in that only
the final choice, rather than all arm pulls, brings a reward, that is, the
simple regret,... | computer science |
18,672 | Self-Organizing Mixture Networks for Representation of Grayscale Digital
Images | cs.AI | Self-Organizing Maps are commonly used for unsupervised learning purposes.
This paper is dedicated to the certain modification of SOM called SOMN
(Self-Organizing Mixture Networks) used as a mechanism for representing
grayscale digital images. Any grayscale digital image regarded as a
distribution function can be appro... | computer science |
18,673 | Detection and emergence | cs.AI | Two different conceptions of emergence are reconciled as two instances of the
phenomenon of detection. In the process of comparing these two conceptions, we
find that the notions of complexity and detection allow us to form a unified
definition of emergence that clearly delineates the role of the observer. | computer science |
18,674 | dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation | cs.AI | The aim of this paper is to announce the release of a novel system for
abstract argumentation which is based on decomposition and dynamic programming.
We provide first experimental evaluations to show the feasibility of this
approach. | computer science |
18,675 | Making Use of Advances in Answer-Set Programming for Abstract
Argumentation Systems | cs.AI | Dung's famous abstract argumentation frameworks represent the core formalism
for many problems and applications in the field of argumentation which
significantly evolved within the last decade. Recent work in the field has thus
focused on implementations for these frameworks, whereby one of the main
approaches is to us... | computer science |
18,676 | Verbal Characterization of Probabilistic Clusters using Minimal
Discriminative Propositions | cs.AI | In a knowledge discovery process, interpretation and evaluation of the mined
results are indispensable in practice. In the case of data clustering, however,
it is often difficult to see in what aspect each cluster has been formed. This
paper proposes a method for automatic and objective characterization or
"verbalizati... | computer science |
18,677 | Single-trial EEG Discrimination between Wrist and Finger Movement
Imagery and Execution in a Sensorimotor BCI | cs.AI | A brain-computer interface (BCI) may be used to control a prosthetic or
orthotic hand using neural activity from the brain. The core of this
sensorimotor BCI lies in the interpretation of the neural information extracted
from electroencephalogram (EEG). It is desired to improve on the interpretation
of EEG to allow peo... | computer science |
18,678 | FdConfig: A Constraint-Based Interactive Product Configurator | cs.AI | We present a constraint-based approach to interactive product configuration.
Our configurator tool FdConfig is based on feature models for the
representation of the product domain. Such models can be directly mapped into
constraint satisfaction problems and dealt with by appropriate constraint
solvers. During the inter... | computer science |
18,679 | Nested HEX-Programs | cs.AI | Answer-Set Programming (ASP) is an established declarative programming
paradigm. However, classical ASP lacks subprogram calls as in procedural
programming, and access to external computations (like remote procedure calls)
in general. The feature is desired for increasing modularity and---assuming
proper access in plac... | computer science |
18,680 | Structure Selection from Streaming Relational Data | cs.AI | Statistical relational learning techniques have been successfully applied in
a wide range of relational domains. In most of these applications, the human
designers capitalized on their background knowledge by following a
trial-and-error trajectory, where relational features are manually defined by a
human engineer, par... | computer science |
18,681 | A Constraint Logic Programming Approach for Computing Ordinal
Conditional Functions | cs.AI | In order to give appropriate semantics to qualitative conditionals of the
form "if A then normally B", ordinal conditional functions (OCFs) ranking the
possible worlds according to their degree of plausibility can be used. An OCF
accepting all conditionals of a knowledge base R can be characterized as the
solution of a... | computer science |
18,682 | Confidentiality-Preserving Data Publishing for Credulous Users by
Extended Abduction | cs.AI | Publishing private data on external servers incurs the problem of how to
avoid unwanted disclosure of confidential data. We study a problem of
confidentiality in extended disjunctive logic programs and show how it can be
solved by extended abduction. In particular, we analyze how credulous
non-monotonic reasoning affec... | computer science |
18,683 | Domain-specific Languages in a Finite Domain Constraint Programming
System | cs.AI | In this paper, we present domain-specific languages (DSLs) that we devised
for their use in the implementation of a finite domain constraint programming
system, available as library(clpfd) in SWI-Prolog and YAP-Prolog. These DSLs
are used in propagator selection and constraint reification. In these areas,
they lead to ... | computer science |
18,684 | Coprocessor - a Standalone SAT Preprocessor | cs.AI | In this work a stand-alone preprocessor for SAT is presented that is able to
perform most of the known preprocessing techniques. Preprocessing a formula in
SAT is important for performance since redundancy can be removed. The
preprocessor is part of the SAT solver riss and is called Coprocessor. Not only
riss, but also... | computer science |
18,685 | Causes of Ineradicable Spurious Predictions in Qualitative Simulation | cs.AI | It was recently proved that a sound and complete qualitative simulator does
not exist, that is, as long as the input-output vocabulary of the
state-of-the-art QSIM algorithm is used, there will always be input models
which cause any simulator with a coverage guarantee to make spurious
predictions in its output. In this... | computer science |
18,686 | Properties and Applications of Programs with Monotone and Convex
Constraints | cs.AI | We study properties of programs with monotone and convex constraints. We
extend to these formalisms concepts and results from normal logic programming.
They include the notions of strong and uniform equivalence with their
characterizations, tight programs and Fages Lemma, program completion and loop
formulas. Our resul... | computer science |
18,687 | How the Landscape of Random Job Shop Scheduling Instances Depends on the
Ratio of Jobs to Machines | cs.AI | We characterize the search landscape of random instances of the job shop
scheduling problem (JSP). Specifically, we investigate how the expected values
of (1) backbone size, (2) distance between near-optimal schedules, and (3)
makespan of random schedules vary as a function of the job to machine ratio
(N/M). For the li... | computer science |
18,688 | Preference-based Search using Example-Critiquing with Suggestions | cs.AI | We consider interactive tools that help users search for their most preferred
item in a large collection of options. In particular, we examine
example-critiquing, a technique for enabling users to incrementally construct
preference models by critiquing example options that are presented to them. We
present novel techni... | computer science |
18,689 | Anytime Point-Based Approximations for Large POMDPs | cs.AI | The Partially Observable Markov Decision Process has long been recognized as
a rich framework for real-world planning and control problems, especially in
robotics. However exact solutions in this framework are typically
computationally intractable for all but the smallest problems. A well-known
technique for speeding u... | computer science |
18,690 | Solving Factored MDPs with Hybrid State and Action Variables | cs.AI | Efficient representations and solutions for large decision problems with
continuous and discrete variables are among the most important challenges faced
by the designers of automated decision support systems. In this paper, we
describe a novel hybrid factored Markov decision process (MDP) model that
allows for a compac... | computer science |
18,691 | Combination Strategies for Semantic Role Labeling | cs.AI | This paper introduces and analyzes a battery of inference models for the
problem of semantic role labeling: one based on constraint satisfaction, and
several strategies that model the inference as a meta-learning problem using
discriminative classifiers. These classifiers are developed with a rich set of
novel features... | computer science |
18,692 | A Behavioral Distance for Fuzzy-Transition Systems | cs.AI | In contrast to the existing approaches to bisimulation for fuzzy systems, we
introduce a behavioral distance to measure the behavioral similarity of states
in a nondeterministic fuzzy-transition system. This behavioral distance is
defined as the greatest fixed point of a suitable monotonic function and
provides a quant... | computer science |
18,693 | Engineering Benchmarks for Planning: the Domains Used in the
Deterministic Part of IPC-4 | cs.AI | In a field of research about general reasoning mechanisms, it is essential to
have appropriate benchmarks. Ideally, the benchmarks should reflect possible
applications of the developed technology. In AI Planning, researchers more and
more tend to draw their testing examples from the benchmark collections used in
the In... | computer science |
18,694 | Modelling Mixed Discrete-Continuous Domains for Planning | cs.AI | In this paper we present pddl+, a planning domain description language for
modelling mixed discrete-continuous planning domains. We describe the syntax
and modelling style of pddl+, showing that the language makes convenient the
modelling of complex time-dependent effects. We provide a formal semantics for
pddl+ by map... | computer science |
18,695 | Set Intersection and Consistency in Constraint Networks | cs.AI | In this paper, we show that there is a close relation between consistency in
a constraint network and set intersection. A proof schema is provided as a
generic way to obtain consistency properties from properties on set
intersection. This approach not only simplifies the understanding of and
unifies many existing consi... | computer science |
18,696 | Consistency and Random Constraint Satisfaction Models | cs.AI | In this paper, we study the possibility of designing non-trivial random CSP
models by exploiting the intrinsic connection between structures and
typical-case hardness. We show that constraint consistency, a notion that has
been developed to improve the efficiency of CSP algorithms, is in fact the key
to the design of r... | computer science |
18,697 | Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms | cs.AI | In this paper, we present two alternative approaches to defining answer sets
for logic programs with arbitrary types of abstract constraint atoms (c-atoms).
These approaches generalize the fixpoint-based and the level mapping based
answer set semantics of normal logic programs to the case of logic programs
with arbitra... | computer science |
18,698 | Bin Completion Algorithms for Multicontainer Packing, Knapsack, and
Covering Problems | cs.AI | Many combinatorial optimization problems such as the bin packing and multiple
knapsack problems involve assigning a set of discrete objects to multiple
containers. These problems can be used to model task and resource allocation
problems in multi-agent systems and distributed systms, and can also be found
as subproblem... | computer science |
18,699 | Uncertainty in Soft Temporal Constraint Problems:A General Framework and
Controllability Algorithms forThe Fuzzy Case | cs.AI | In real-life temporal scenarios, uncertainty and preferences are often
essential and coexisting aspects. We present a formalism where quantitative
temporal constraints with both preferences and uncertainty can be defined. We
show how three classical notions of controllability (that is, strong, weak, and
dynamic), which... | computer science |
18,700 | Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal
Periodic Sets | cs.AI | In the recent years several research efforts have focused on the concept of
time granularity and its applications. A first stream of research investigated
the mathematical models behind the notion of granularity and the algorithms to
manage temporal data based on those models. A second stream of research
investigated s... | computer science |
18,701 | The Generalized A* Architecture | cs.AI | We consider the problem of computing a lightest derivation of a global
structure using a set of weighted rules. A large variety of inference problems
in AI can be formulated in this framework. We generalize A* search and
heuristics derived from abstractions to a broad class of lightest derivation
problems. We also desc... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.