Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,702 | Combining Spatial and Temporal Logics: Expressiveness vs. Complexity | cs.AI | In this paper, we construct and investigate a hierarchy of spatio-temporal
formalisms that result from various combinations of propositional spatial and
temporal logics such as the propositional temporal logic PTL, the spatial
logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a
clear picture of t... | computer science |
18,703 | An Approach to Temporal Planning and Scheduling in Domains with
Predictable Exogenous Events | cs.AI | The treatment of exogenous events in planning is practically important in
many real-world domains where the preconditions of certain plan actions are
affected by such events. In this paper we focus on planning in temporal domains
with exogenous events that happen at known times, imposing the constraint that
certain act... | computer science |
18,704 | The Power of Modeling - a Response to PDDL2.1 | cs.AI | In this commentary I argue that although PDDL is a very useful standard for
the planning competition, its design does not properly consider the issue of
domain modeling. Hence, I would not advocate its use in specifying planning
domains outside of the context of the planning competition. Rather, the field
needs to expl... | computer science |
18,705 | Imperfect Match: PDDL 2.1 and Real Applications | cs.AI | PDDL was originally conceived and constructed as a lingua franca for the
International Planning Competition. PDDL2.1 embodies a set of extensions
intended to support the expression of something closer to real planning
problems. This objective has only been partially achieved, due in large part to
a deliberate focus on ... | computer science |
18,706 | PDDL 2.1: Representation vs. Computation | cs.AI | I comment on the PDDL 2.1 language and its use in the planning competition,
focusing on the choices made for accommodating time and concurrency. I also
discuss some methodological issues that have to do with the move toward more
expressive planning languages and the balance needed in planning research
between semantics... | computer science |
18,707 | Proactive Algorithms for Job Shop Scheduling with Probabilistic
Durations | cs.AI | Most classical scheduling formulations assume a fixed and known duration for
each activity. In this paper, we weaken this assumption, requiring instead that
each duration can be represented by an independent random variable with a known
mean and variance. The best solutions are ones which have a high probability of
ach... | computer science |
18,708 | The Language of Search | cs.AI | This paper is concerned with a class of algorithms that perform exhaustive
search on propositional knowledge bases. We show that each of these algorithms
defines and generates a propositional language. Specifically, we show that the
trace of a search can be interpreted as a combinational circuit, and a search
algorithm... | computer science |
18,709 | Understanding Algorithm Performance on an Oversubscribed Scheduling
Application | cs.AI | The best performing algorithms for a particular oversubscribed scheduling
application, Air Force Satellite Control Network (AFSCN) scheduling, appear to
have little in common. Yet, through careful experimentation and modeling of
performance in real problem instances, we can relate characteristics of the
best algorithms... | computer science |
18,710 | Marvin: A Heuristic Search Planner with Online Macro-Action Learning | cs.AI | This paper describes Marvin, a planner that competed in the Fourth
International Planning Competition (IPC 4). Marvin uses
action-sequence-memoisation techniques to generate macro-actions, which are
then used during search for a solution plan. We provide an overview of its
architecture and search behaviour, detailing t... | computer science |
18,711 | Anytime Heuristic Search | cs.AI | We describe how to convert the heuristic search algorithm A* into an anytime
algorithm that finds a sequence of improved solutions and eventually converges
to an optimal solution. The approach we adopt uses weighted heuristic search to
find an approximate solution quickly, and then continues the weighted search to
find... | computer science |
18,712 | Discovering Classes of Strongly Equivalent Logic Programs | cs.AI | In this paper we apply computer-aided theorem discovery technique to discover
theorems about strongly equivalent logic programs under the answer set
semantics. Our discovered theorems capture new classes of strongly equivalent
logic programs that can lead to new program simplification rules that preserve
strong equival... | computer science |
18,713 | Phase Transition for Random Quantified XOR-Formulas | cs.AI | The QXORSAT problem is the quantified version of the satisfiability problem
XORSAT in which the connective exclusive-or is used instead of the usual or. We
study the phase transition associated with random QXORSAT instances. We give a
description of this phase transition in the case of one alternation of
quantifiers, t... | computer science |
18,714 | Cutset Sampling for Bayesian Networks | cs.AI | The paper presents a new sampling methodology for Bayesian networks that
samples only a subset of variables and applies exact inference to the rest.
Cutset sampling is a network structure-exploiting application of the
Rao-Blackwellisation principle to sampling in Bayesian networks. It improves
convergence by exploiting... | computer science |
18,715 | An Algebraic Graphical Model for Decision with Uncertainties,
Feasibilities, and Utilities | cs.AI | Numerous formalisms and dedicated algorithms have been designed in the last
decades to model and solve decision making problems. Some formalisms, such as
constraint networks, can express "simple" decision problems, while others are
designed to take into account uncertainties, unfeasible decisions, and
utilities. Even i... | computer science |
18,716 | Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic
Approach | cs.AI | Matchmaking arises when supply and demand meet in an electronic marketplace,
or when agents search for a web service to perform some task, or even when
recruiting agencies match curricula and job profiles. In such open
environments, the objective of a matchmaking process is to discover best
available offers to a given ... | computer science |
18,717 | Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling | cs.AI | Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel
constructive search technique that performs a series of resource-limited tree
searches where each search begins either from an empty solution (as in
randomized restart) or from a solution that has been encountered during the
search. A small number of t... | computer science |
18,718 | Are Minds Computable? | cs.AI | This essay explores the limits of Turing machines concerning the modeling of
minds and suggests alternatives to go beyond those limits. | computer science |
18,719 | Fuzzy Inference Systems Optimization | cs.AI | This paper compares various optimization methods for fuzzy inference system
optimization. The optimization methods compared are genetic algorithm, particle
swarm optimization and simulated annealing. When these techniques were
implemented it was observed that the performance of each technique within the
fuzzy inference... | computer science |
18,720 | Handling controversial arguments by matrix | cs.AI | We introduce matrix and its block to the Dung's theory of argumentation
framework. It is showed that each argumentation framework has a matrix
representation, and the indirect attack relation and indirect defence relation
can be characterized by computing the matrix. This provide a powerful
mathematics way to determine... | computer science |
18,721 | Learning in Real-Time Search: A Unifying Framework | cs.AI | Real-time search methods are suited for tasks in which the agent is
interacting with an initially unknown environment in real time. In such
simultaneous planning and learning problems, the agent has to select its
actions in a limited amount of time, while sensing only a local part of the
environment centered at the age... | computer science |
18,722 | A Generalized Arc-Consistency Algorithm for a Class of Counting
Constraints: Revised Edition that Incorporates One Correction | cs.AI | This paper introduces the SEQ BIN meta-constraint with a polytime algorithm
achieving general- ized arc-consistency according to some properties. SEQ BIN
can be used for encoding counting con- straints such as CHANGE, SMOOTH or
INCREAS- ING NVALUE. For some of these constraints and some of their variants
GAC can be enf... | computer science |
18,723 | Quels formalismes temporels pour représenter des connaissances
extraites de textes de recettes de cuisine ? | cs.AI | The Taaable projet goal is to create a case-based reasoning system for
retrieval and adaptation of cooking recipes. Within this framework, we are
discussing the temporal aspects of recipes and the means of representing those
in order to adapt their text. | computer science |
18,724 | Modelling Constraint Solver Architecture Design as a Constraint Problem | cs.AI | Designing component-based constraint solvers is a complex problem. Some
components are required, some are optional and there are interdependencies
between the components. Because of this, previous approaches to solver design
and modification have been ad-hoc and limited. We present a system that
transforms a descriptio... | computer science |
18,725 | A cognitive diversity framework for radar target classification | cs.AI | Classification of targets by radar has proved to be notoriously difficult
with the best systems still yet to attain sufficiently high levels of
performance and reliability. In the current contribution we explore a new
design of radar based target recognition, where angular diversity is used in a
cognitive manner to att... | computer science |
18,726 | Reasoning with Very Expressive Fuzzy Description Logics | cs.AI | It is widely recognized today that the management of imprecision and
vagueness will yield more intelligent and realistic knowledge-based
applications. Description Logics (DLs) are a family of knowledge representation
languages that have gained considerable attention the last decade, mainly due
to their decidability and... | computer science |
18,727 | New Inference Rules for Max-SAT | cs.AI | Exact Max-SAT solvers, compared with SAT solvers, apply little inference at
each node of the proof tree. Commonly used SAT inference rules like unit
propagation produce a simplified formula that preserves satisfiability but,
unfortunately, solving the Max-SAT problem for the simplified formula is not
equivalent to solv... | computer science |
18,728 | Obtaining Reliable Feedback for Sanctioning Reputation Mechanisms | cs.AI | Reputation mechanisms offer an effective alternative to verification
authorities for building trust in electronic markets with moral hazard. Future
clients guide their business decisions by considering the feedback from past
transactions; if truthfully exposed, cheating behavior is sanctioned and thus
becomes irrationa... | computer science |
18,729 | Probabilistic Planning via Heuristic Forward Search and Weighted Model
Counting | cs.AI | We present a new algorithm for probabilistic planning with no observability.
Our algorithm, called Probabilistic-FF, extends the heuristic forward-search
machinery of Conformant-FF to problems with probabilistic uncertainty about
both the initial state and action effects. Specifically, Probabilistic-FF
combines Conform... | computer science |
18,730 | Conjunctive Query Answering for the Description Logic SHIQ | cs.AI | Conjunctive queries play an important role as an expressive query language
for Description Logics (DLs). Although modern DLs usually provide for
transitive roles, conjunctive query answering over DL knowledge bases is only
poorly understood if transitive roles are admitted in the query. In this paper,
we consider union... | computer science |
18,731 | Qualitative System Identification from Imperfect Data | cs.AI | Experience in the physical sciences suggests that the only realistic means of
understanding complex systems is through the use of mathematical models.
Typically, this has come to mean the identification of quantitative models
expressed as differential equations. Quantitative modelling works best when the
structure of t... | computer science |
18,732 | Exploiting Subgraph Structure in Multi-Robot Path Planning | cs.AI | Multi-robot path planning is difficult due to the combinatorial explosion of
the search space with every new robot added. Complete search of the combined
state-space soon becomes intractable. In this paper we present a novel form of
abstraction that allows us to plan much more efficiently. The key to this
abstraction i... | computer science |
18,733 | Extended RDF as a Semantic Foundation of Rule Markup Languages | cs.AI | Ontologies and automated reasoning are the building blocks of the Semantic
Web initiative. Derivation rules can be included in an ontology to define
derived concepts, based on base concepts. For example, rules allow to define
the extension of a class or property, based on a complex relation between the
extensions of th... | computer science |
18,734 | The Complexity of Planning Problems With Simple Causal Graphs | cs.AI | We present three new complexity results for classes of planning problems with
simple causal graphs. First, we describe a polynomial-time algorithm that uses
macros to generate plans for the class 3S of planning problems with binary
state variables and acyclic causal graphs. This implies that plan generation
may be trac... | computer science |
18,735 | Loosely Coupled Formulations for Automated Planning: An Integer
Programming Perspective | cs.AI | We represent planning as a set of loosely coupled network flow problems,
where each network corresponds to one of the state variables in the planning
domain. The network nodes correspond to the state variable values and the
network arcs correspond to the value transitions. The planning problem is to
find a path (a sequ... | computer science |
18,736 | A Constraint Programming Approach for Solving a Queueing Control Problem | cs.AI | In a facility with front room and back room operations, it is useful to
switch workers between the rooms in order to cope with changing customer
demand. Assuming stochastic customer arrival and service times, we seek a
policy for switching workers such that the expected customer waiting time is
minimized while the expe... | computer science |
18,737 | Optimal and Approximate Q-value Functions for Decentralized POMDPs | cs.AI | Decision-theoretic planning is a popular approach to sequential decision
making problems, because it treats uncertainty in sensing and acting in a
principled way. In single-agent frameworks like MDPs and POMDPs, planning can
be carried out by resorting to Q-value functions: an optimal Q-value function
Q* is computed in... | computer science |
18,738 | Communication-Based Decomposition Mechanisms for Decentralized MDPs | cs.AI | Multi-agent planning in stochastic environments can be framed formally as a
decentralized Markov decision problem. Many real-life distributed problems that
arise in manufacturing, multi-robot coordination and information gathering
scenarios can be formalized using this framework. However, finding the optimal
solution i... | computer science |
18,739 | A General Theory of Additive State Space Abstractions | cs.AI | Informally, a set of abstractions of a state space S is additive if the
distance between any two states in S is always greater than or equal to the sum
of the corresponding distances in the abstract spaces. The first known additive
abstractions, called disjoint pattern databases, were experimentally
demonstrated to pro... | computer science |
18,740 | First Order Decision Diagrams for Relational MDPs | cs.AI | Markov decision processes capture sequential decision making under
uncertainty, where an agent must choose actions so as to optimize long term
reward. The paper studies efficient reasoning mechanisms for Relational Markov
Decision Processes (RMDP) where world states have an internal relational
structure that can be nat... | computer science |
18,741 | Clause/Term Resolution and Learning in the Evaluation of Quantified
Boolean Formulas | cs.AI | Resolution is the rule of inference at the basis of most procedures for
automated reasoning. In these procedures, the input formula is first translated
into an equisatisfiable formula in conjunctive normal form (CNF) and then
represented as a set of clauses. Deduction starts by inferring new clauses by
resolution, and ... | computer science |
18,742 | MIVAR: Transition from Productions to Bipartite Graphs MIVAR Nets and
Practical Realization of Automated Constructor of Algorithms Handling More
than Three Million Production Rules | cs.AI | The theoretical transition from the graphs of production systems to the
bipartite graphs of the MIVAR nets is shown. Examples of the implementation of
the MIVAR nets in the formalisms of matrixes and graphs are given. The linear
computational complexity of algorithms for automated building of objects and
rules of the M... | computer science |
18,743 | Embedding Description Logic Programs into Default Logic | cs.AI | Description logic programs (dl-programs) under the answer set semantics
formulated by Eiter {\em et al.} have been considered as a prominent formalism
for integrating rules and ontology knowledge bases. A question of interest has
been whether dl-programs can be captured in a general formalism of nonmonotonic
logic. In ... | computer science |
18,744 | Semantic-Driven e-Government: Application of Uschold and King Ontology
Building Methodology for Semantic Ontology Models Development | cs.AI | Electronic government (e-government) has been one of the most active areas of
ontology development during the past six years. In e-government, ontologies are
being used to describe and specify e-government services (e-services) because
they enable easy composition, matching, mapping and merging of various
e-government ... | computer science |
18,745 | SATzilla: Portfolio-based Algorithm Selection for SAT | cs.AI | It has been widely observed that there is no single "dominant" SAT solver;
instead, different solvers perform best on different instances. Rather than
following the traditional approach of choosing the best solver for a given
class of instances, we advocate making this decision online on a per-instance
basis. Building ... | computer science |
18,746 | 8-Valent Fuzzy Logic for Iris Recognition and Biometry | cs.AI | This paper shows that maintaining logical consistency of an iris recognition
system is a matter of finding a suitable partitioning of the input space in
enrollable and unenrollable pairs by negotiating the user comfort and the
safety of the biometric system. In other words, consistent enrollment is
mandatory in order t... | computer science |
18,747 | New Candidates Welcome! Possible Winners with respect to the Addition of
New Candidates | cs.AI | In voting contexts, some new candidates may show up in the course of the
process. In this case, we may want to determine which of the initial candidates
are possible winners, given that a fixed number $k$ of new candidates will be
added. We give a computational study of this problem, focusing on scoring
rules, and we p... | computer science |
18,748 | Model-based Utility Functions | cs.AI | Orseau and Ring, as well as Dewey, have recently described problems,
including self-delusion, with the behavior of agents using various definitions
of utility functions. An agent's utility function is defined in terms of the
agent's history of interactions with its environment. This paper argues, via
two examples, that... | computer science |
18,749 | Unbiased Statistics of a CSP - A Controlled-Bias Generator | cs.AI | We show that estimating the complexity (mean and distribution) of the
instances of a fixed size Constraint Satisfaction Problem (CSP) can be very
hard. We deal with the main two aspects of the problem: defining a measure of
complexity and generating random unbiased instances. For the first problem, we
rely on a general... | computer science |
18,750 | A Model of Spatial Thinking for Computational Intelligence | cs.AI | Trying to be effective (no matter who exactly and in what field) a person
face the problem which inevitably destroys all our attempts to easily get to a
desired goal. The problem is the existence of some insuperable barriers for our
mind, anotherwords barriers for principles of thinking. They are our clue and
main reas... | computer science |
18,751 | Revisiting Numerical Pattern Mining with Formal Concept Analysis | cs.AI | In this paper, we investigate the problem of mining numerical data in the
framework of Formal Concept Analysis. The usual way is to use a scaling
procedure --transforming numerical attributes into binary ones-- leading either
to a loss of information or of efficiency, in particular w.r.t. the volume of
extracted patter... | computer science |
18,752 | Principles of Solomonoff Induction and AIXI | cs.AI | We identify principles characterizing Solomonoff Induction by demands on an
agent's external behaviour. Key concepts are rationality, computability,
indifference and time consistency. Furthermore, we discuss extensions to the
full AI case to derive AIXI. | computer science |
18,753 | Pattern-Based Classification: A Unifying Perspective | cs.AI | The use of patterns in predictive models is a topic that has received a lot
of attention in recent years. Pattern mining can help to obtain models for
structured domains, such as graphs and sequences, and has been proposed as a
means to obtain more accurate and more interpretable models. Despite the large
amount of pub... | computer science |
18,754 | Graph based E-Government web service composition | cs.AI | Nowadays, e-government has emerged as a government policy to improve the
quality and efficiency of public administrations. By exploiting the potential
of new information and communication technologies, government agencies are
providing a wide spectrum of online services. These services are composed of
several web servi... | computer science |
18,755 | An Enhanced Indexing And Ranking Technique On The Semantic Web | cs.AI | With the fast growth of the Internet, more and more information is available
on the Web. The Semantic Web has many features which cannot be handled by using
the traditional search engines. It extracts metadata for each discovered Web
documents in RDF or OWL formats, and computes relations between documents. We
proposed... | computer science |
18,756 | Constraining the Size Growth of the Task Space with Socially Guided
Intrinsic Motivation using Demonstrations | cs.AI | This paper presents an algorithm for learning a highly redundant inverse
model in continuous and non-preset environments. Our Socially Guided Intrinsic
Motivation by Demonstrations (SGIM-D) algorithm combines the advantages of both
social learning and intrinsic motivation, to specialise in a wide range of
skills, while... | computer science |
18,757 | Continuity in Information Algebras | cs.AI | In this paper, the continuity and strong continuity in domain-free
information algebras and labeled information algebras are introduced
respectively. A more general concept of continuous function which is defined
between two domain-free continuous information algebras is presented. It is
shown that, with the operations... | computer science |
18,758 | The RegularGcc Matrix Constraint | cs.AI | We study propagation of the RegularGcc global constraint. This ensures that
each row of a matrix of decision variables satisfies a Regular constraint, and
each column satisfies a Gcc constraint. On the negative side, we prove that
propagation is NP-hard even under some strong restrictions (e.g. just 3 values,
just 4 st... | computer science |
18,759 | Optimal Fuzzy Model Construction with Statistical Information using
Genetic Algorithm | cs.AI | Fuzzy rule based models have a capability to approximate any continuous
function to any degree of accuracy on a compact domain. The majority of FLC
design process relies on heuristic knowledge of experience operators. In order
to make the design process automatic we present a genetic approach to learn
fuzzy rules as we... | computer science |
18,760 | Ultrametric Model of Mind, I: Review | cs.AI | We mathematically model Ignacio Matte Blanco's principles of symmetric and
asymmetric being through use of an ultrametric topology. We use for this the
highly regarded 1975 book of this Chilean psychiatrist and pyschoanalyst (born
1908, died 1995). Such an ultrametric model corresponds to hierarchical
clustering in the... | computer science |
18,761 | Tacit knowledge mining algorithm based on linguistic truth-valued
concept lattice | cs.AI | This paper is the continuation of our research work about linguistic
truth-valued concept lattice. In order to provide a mathematical tool for
mining tacit knowledge, we establish a concrete model of 6-ary linguistic
truth-valued concept lattice and introduce a mining algorithm through the
structure consistency. Specif... | computer science |
18,762 | Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy | cs.AI | Large-scale, parallel clusters composed of commodity processors are
increasingly available, enabling the use of vast processing capabilities and
distributed RAM to solve hard search problems. We investigate Hash-Distributed
A* (HDA*), a simple approach to parallel best-first search that asynchronously
distributes and s... | computer science |
18,763 | The computation of first order moments on junction trees | cs.AI | We review some existing methods for the computation of first order moments on
junction trees using Shafer-Shenoy algorithm. First, we consider the problem of
first order moments computation as vertices problem in junction trees. In this
way, the problem is solved using the memory space of an order of the junction
tree ... | computer science |
18,764 | Progress in animation of an EMA-controlled tongue model for
acoustic-visual speech synthesis | cs.AI | We present a technique for the animation of a 3D kinematic tongue model, one
component of the talking head of an acoustic-visual (AV) speech synthesizer.
The skeletal animation approach is adapted to make use of a deformable rig
controlled by tongue motion capture data obtained with electromagnetic
articulography (EMA)... | computer science |
18,765 | Constraint Propagation as Information Maximization | cs.AI | This paper draws on diverse areas of computer science to develop a unified
view of computation:
(1) Optimization in operations research, where a numerical objective function
is maximized under constraints, is generalized from the numerical total order
to a non-numerical partial order that can be interpreted in terms ... | computer science |
18,766 | A multiagent urban traffic simulation | cs.AI | We built a multiagent simulation of urban traffic to model both ordinary
traffic and emergency or crisis mode traffic. This simulation first builds a
modeled road network based on detailed geographical information. On this
network, the simulation creates two populations of agents: the Transporters and
the Mobiles. Tran... | computer science |
18,767 | The thermodynamic cost of fast thought | cs.AI | After more than sixty years, Shannon's research [1-3] continues to raise
fundamental questions, such as the one formulated by Luce [4,5], which is still
unanswered: "Why is information theory not very applicable to psychological
problems, despite apparent similarities of concepts?" On this topic, Pinker
[6], one of the... | computer science |
18,768 | Ontologies for the Integration of Air Quality Models and 3D City Models | cs.AI | The holistic approach to sustainable urban planning implies using different
models in an integrated way that is capable of simulating the urban system. As
the interconnection of such models is not a trivial task, one of the key
elements that may be applied is the description of the urban geometric
properties in an "int... | computer science |
18,769 | Development of an Ontology to Assist the Modeling of Accident Scenarii
"Application on Railroad Transport " | cs.AI | In a world where communication and information sharing are at the heart of
our business, the terminology needs are most pressing. It has become imperative
to identify the terms used and defined in a consensual and coherent way while
preserving linguistic diversity. To streamline and strengthen the process of
acquisitio... | computer science |
18,770 | Search Combinators | cs.AI | The ability to model search in a constraint solver can be an essential asset
for solving combinatorial problems. However, existing infrastructure for
defining search heuristics is often inadequate. Either modeling capabilities
are extremely limited or users are faced with a general-purpose programming
language whose fe... | computer science |
18,771 | Multi source feedback based performance appraisal system using Fuzzy
logic decision support system | cs.AI | In Multi-Source Feedback or 360 Degree Feedback, data on the performance of
an individual are collected systematically from a number of stakeholders and
are used for improving performance. The 360-Degree Feedback approach provides a
consistent management philosophy meeting the criterion outlined previously. The
360-deg... | computer science |
18,772 | Combining Voting Rules Together | cs.AI | We propose a simple method for combining together voting rules that performs
a run-off between the different winners of each voting rule. We prove that this
combinator has several good properties. For instance, even if just one of the
base voting rules has a desirable property like Condorcet consistency, the
combinatio... | computer science |
18,773 | Gibbs Sampling in Open-Universe Stochastic Languages | cs.AI | Languages for open-universe probabilistic models (OUPMs) can represent
situations with an unknown number of objects and iden- tity uncertainty. While
such cases arise in a wide range of important real-world appli- cations,
existing general purpose inference methods for OUPMs are far less efficient
than those available ... | computer science |
18,774 | Compiling Possibilistic Networks: Alternative Approaches to
Possibilistic Inference | cs.AI | Qualitative possibilistic networks, also known as min-based possibilistic
networks, are important tools for handling uncertain information in the
possibility theory frame- work. Despite their importance, only the junction
tree adaptation has been proposed for exact reasoning with such networks. This
paper explores alte... | computer science |
18,775 | Possibilistic Answer Set Programming Revisited | cs.AI | Possibilistic answer set programming (PASP) extends answer set programming
(ASP) by attaching to each rule a degree of certainty. While such an extension
is important from an application point of view, existing semantics are not
well-motivated, and do not always yield intuitive results. To develop a more
suitable seman... | computer science |
18,776 | Three new sensitivity analysis methods for influence diagrams | cs.AI | Performing sensitivity analysis for influence diagrams using the decision
circuit framework is particularly convenient, since the partial derivatives
with respect to every parameter are readily available [Bhattacharjya and
Shachter, 2007; 2008]. In this paper we present three non-linear sensitivity
analysis methods tha... | computer science |
18,777 | Probabilistic Similarity Logic | cs.AI | Many machine learning applications require the ability to learn from and
reason about noisy multi-relational data. To address this, several effective
representations have been developed that provide both a language for expressing
the structural regularities of a domain, and principled support for
probabilistic inferenc... | computer science |
18,778 | ALARMS: Alerting and Reasoning Management System for Next Generation
Aircraft Hazards | cs.AI | The Next Generation Air Transportation System will introduce new, advanced
sensor technologies into the cockpit. With the introduction of such systems,
the responsibilities of the pilot are expected to dramatically increase. In the
ALARMS (ALerting And Reasoning Management System) project for NASA, we focus on
a key ch... | computer science |
18,779 | Lifted Inference for Relational Continuous Models | cs.AI | Relational Continuous Models (RCMs) represent joint probability densities
over attributes of objects, when the attributes have continuous domains. With
relational representations, they can model joint probability distributions over
large numbers of variables compactly in a natural way. This paper presents a
new exact l... | computer science |
18,780 | Distribution over Beliefs for Memory Bounded Dec-POMDP Planning | cs.AI | We propose a new point-based method for approximate planning in Dec-POMDP
which outperforms the state-of-the-art approaches in terms of solution quality.
It uses a heuristic estimation of the prior probability of beliefs to choose a
bounded number of policy trees: this choice is formulated as a combinatorial
optimisati... | computer science |
18,781 | A Scalable Method for Solving High-Dimensional Continuous POMDPs Using
Local Approximation | cs.AI | Partially-Observable Markov Decision Processes (POMDPs) are typically solved
by finding an approximate global solution to a corresponding belief-MDP. In
this paper, we offer a new planning algorithm for POMDPs with continuous state,
action and observation spaces. Since such domains have an inherent notion of
locality, ... | computer science |
18,782 | Formula-Based Probabilistic Inference | cs.AI | Computing the probability of a formula given the probabilities or weights
associated with other formulas is a natural extension of logical inference to
the probabilistic setting. Surprisingly, this problem has received little
attention in the literature to date, particularly considering that it includes
many standard i... | computer science |
18,783 | Anytime Planning for Decentralized POMDPs using Expectation Maximization | cs.AI | Decentralized POMDPs provide an expressive framework for multi-agent
sequential decision making. While fnite-horizon DECPOMDPs have enjoyed
signifcant success, progress remains slow for the infnite-horizon case mainly
due to the inherent complexity of optimizing stochastic controllers
representing agent policies. We pr... | computer science |
18,784 | Solving Hybrid Influence Diagrams with Deterministic Variables | cs.AI | We describe a framework and an algorithm for solving hybrid influence
diagrams with discrete, continuous, and deterministic chance variables, and
discrete and continuous decision variables. A continuous chance variable in an
influence diagram is said to be deterministic if its conditional distributions
have zero varian... | computer science |
18,785 | A Delayed Column Generation Strategy for Exact k-Bounded MAP Inference
in Markov Logic Networks | cs.AI | The paper introduces k-bounded MAP inference, a parameterization of MAP
inference in Markov logic networks. k-Bounded MAP states are MAP states with at
most k active ground atoms of hidden (non-evidence) predicates. We present a
novel delayed column generation algorithm and provide empirical evidence that
the algorithm... | computer science |
18,786 | Comparative Analysis of Probabilistic Models for Activity Recognition
with an Instrumented Walker | cs.AI | Rollating walkers are popular mobility aids used by older adults to improve
balance control. There is a need to automatically recognize the activities
performed by walker users to better understand activity patterns, mobility
issues and the context in which falls are more likely to happen. We design and
compare several... | computer science |
18,787 | Merging Knowledge Bases in Possibilistic Logic by Lexicographic
Aggregation | cs.AI | Belief merging is an important but difficult problem in Artificial
Intelligence, especially when sources of information are pervaded with
uncertainty. Many merging operators have been proposed to deal with this
problem in possibilistic logic, a weighted logic which is powerful for handling
inconsistency and deal- ing w... | computer science |
18,788 | Characterizing the Set of Coherent Lower Previsions with a Finite Number
of Constraints or Vertices | cs.AI | The standard coherence criterion for lower previsions is expressed using an
infinite number of linear constraints. For lower previsions that are
essentially defined on some finite set of gambles on a finite possibility
space, we present a reformulation of this criterion that only uses a finite
number of constraints. An... | computer science |
18,789 | Dynamic programming in in uence diagrams with decision circuits | cs.AI | Decision circuits perform efficient evaluation of influence diagrams,
building on the ad- vances in arithmetic circuits for belief net- work
inference [Darwiche, 2003; Bhattachar- jya and Shachter, 2007]. We show how
even more compact decision circuits can be con- structed for dynamic
programming in influ- ence diagram... | computer science |
18,790 | Learning Why Things Change: The Difference-Based Causality Learner | cs.AI | In this paper, we present the Difference- Based Causality Learner (DBCL), an
algorithm for learning a class of discrete-time dynamic models that represents
all causation across time by means of difference equations driving change in a
system. We motivate this representation with real-world mechanical systems and
prove ... | computer science |
18,791 | Rollout Sampling Policy Iteration for Decentralized POMDPs | cs.AI | We present decentralized rollout sampling policy iteration (DecRSPI) - a new
algorithm for multi-agent decision problems formalized as DEC-POMDPs. DecRSPI
is designed to improve scalability and tackle problems that lack an explicit
model. The algorithm uses Monte- Carlo methods to generate a sample of
reachable belief ... | computer science |
18,792 | Solving Multistage Influence Diagrams using Branch-and-Bound Search | cs.AI | A branch-and-bound approach to solving influ- ence diagrams has been
previously proposed in the literature, but appears to have never been
implemented and evaluated - apparently due to the difficulties of computing
effective bounds for the branch-and-bound search. In this paper, we describe
how to efficiently compute e... | computer science |
18,793 | RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains | cs.AI | Despite the intractability of generic optimal partially observable Markov
decision process planning, there exist important problems that have highly
structured models. Previous researchers have used this insight to construct
more efficient algorithms for factored domains, and for domains with
topological structure in t... | computer science |
18,794 | Understanding Sampling Style Adversarial Search Methods | cs.AI | UCT has recently emerged as an exciting new adversarial reasoning technique
based on cleverly balancing exploration and exploitation in a Monte-Carlo
sampling setting. It has been particularly successful in the game of Go but the
reasons for its success are not well understood and attempts to replicate its
success in o... | computer science |
18,795 | Parameter Learning in PRISM Programs with Continuous Random Variables | cs.AI | Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's
PRISM, Poole's ICL, De Raedt et al's ProbLog and Vennekens et al's LPAD,
combines statistical and logical knowledge representation and inference.
Inference in these languages is based on enumerative construction of proofs
over logic programs. Conse... | computer science |
18,796 | Modeling of Mixed Decision Making Process | cs.AI | Decision making whenever and wherever it is happened is key to organizations
success. In order to make correct decision, individuals, teams and
organizations need both knowledge management (to manage content) and
collaboration (to manage group processes) to make that more effective and
efficient. In this paper, we expl... | computer science |
18,797 | On the Use of Non-Stationary Policies for Infinite-Horizon Discounted
Markov Decision Processes | cs.AI | We consider infinite-horizon $\gamma$-discounted Markov Decision Processes,
for which it is known that there exists a stationary optimal policy. We
consider the algorithm Value Iteration and the sequence of policies
$\pi_1,...,\pi_k$ it implicitely generates until some iteration $k$. We provide
performance bounds for n... | computer science |
18,798 | Creating Intelligent Linking for Information Threading in Knowledge
Networks | cs.AI | Informledge System (ILS) is a knowledge network with autonomous nodes and
intelligent links that integrate and structure the pieces of knowledge. In this
paper, we aim to put forward the link dynamics involved in intelligent
processing of information in ILS. There has been advancement in knowledge
management field whic... | computer science |
18,799 | Expert PC Troubleshooter With Fuzzy-Logic And Self-Learning Support | cs.AI | Expert systems use human knowledge often stored as rules within the computer
to solve problems that generally would entail human intelligence. Today, with
information systems turning out to be more pervasive and with the myriad
advances in information technologies, automating computer fault diagnosis is
becoming so fun... | computer science |
18,800 | Unit contradiction versus unit propagation | cs.AI | Some aspects of the result of applying unit resolution on a CNF formula can
be formalized as functions with domain a set of partial truth assignments. We
are interested in two ways for computing such functions, depending on whether
the result is the production of the empty clause or the assignment of a
variable with a ... | computer science |
18,801 | Development of knowledge Base Expert System for Natural treatment of
Diabetes disease | cs.AI | The development of expert system for treatment of Diabetes disease by using
natural methods is new information technology derived from Artificial
Intelligent research using ESTA (Expert System Text Animation) System. The
proposed expert system contains knowledge about various methods of natural
treatment methods (Massa... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.