Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
20,602 | Harmonization of conflicting medical opinions using argumentation
protocols and textual entailment - a case study on Parkinson disease | cs.AI | Parkinson's disease is the second most common neurodegenerative disease,
affecting more than 1.2 million people in Europe. Medications are available for
the management of its symptoms, but the exact cause of the disease is unknown
and there is currently no cure on the market. To better understand the
relations between ... | computer science |
20,603 | Neuromorphic Robot Dream | cs.AI | In this paper we present the next step in our approach to neurobiologically
plausible implementation of emotional reactions and behaviors for real-time
autonomous robotic systems. The working metaphor we use is the "day" and the
"night" phases of mammalian life. During the "day phase" a robotic system
stores the inboun... | computer science |
20,604 | Psychologically inspired planning method for smart relocation task | cs.AI | Behavior planning is known to be one of the basic cognitive functions, which
is essential for any cognitive architecture of any control system used in
robotics. At the same time most of the widespread planning algorithms employed
in those systems are developed using only approaches and models of Artificial
Intelligence... | computer science |
20,605 | A symbolic algebra for the computation of expected utilities in
multiplicative influence diagrams | cs.AI | Influence diagrams provide a compact graphical representation of decision
problems. Several algorithms for the quick computation of their associated
expected utilities are available in the literature. However, often they rely on
a full quantification of both probabilistic uncertainties and utility values.
For problems ... | computer science |
20,606 | A Linear Algebraic Approach to Datalog Evaluation | cs.AI | In this paper, we propose a fundamentally new approach to Datalog evaluation.
Given a linear Datalog program DB written using N constants and binary
predicates, we first translate if-and-only-if completions of clauses in DB into
a set Eq(DB) of matrix equations with a non-linear operation where relations in
M_DB, the l... | computer science |
20,607 | Formulating Semantics of Probabilistic Argumentation by Characterizing
Subgraphs: Theory and Empirical Results | cs.AI | In existing literature, while approximate approaches based on Monte-Carlo
simulation technique have been proposed to compute the semantics of
probabilistic argumentation, how to improve the efficiency of computation
without using simulation technique is still an open problem. In this paper, we
address this problem from... | computer science |
20,608 | Directed expected utility networks | cs.AI | A variety of statistical graphical models have been defined to represent the
conditional independences underlying a random vector of interest. Similarly,
many different graphs embedding various types of preferential independences, as
for example conditional utility independence and generalized additive
independence, ha... | computer science |
20,609 | Generation of Near-Optimal Solutions Using ILP-Guided Sampling | cs.AI | Our interest in this paper is in optimisation problems that are intractable
to solve by direct numerical optimisation, but nevertheless have significant
amounts of relevant domain-specific knowledge. The category of heuristic search
techniques known as estimation of distribution algorithms (EDAs) seek to
incrementally ... | computer science |
20,610 | Learning to Rank for Synthesizing Planning Heuristics | cs.AI | We investigate learning heuristics for domain-specific planning. Prior work
framed learning a heuristic as an ordinary regression problem. However, in a
greedy best-first search, the ordering of states induced by a heuristic is more
indicative of the resulting planner's performance than mean squared error.
Thus, we ins... | computer science |
20,611 | Query Answering in Resource-Based Answer Set Semantics | cs.AI | In recent work we defined resource-based answer set semantics, which is an
extension to answer set semantics stemming from the study of its relationship
with linear logic. In fact, the name of the new semantics comes from the fact
that in the linear-logic formulation every literal (including negative ones)
were conside... | computer science |
20,612 | Stable-Unstable Semantics: Beyond NP with Normal Logic Programs | cs.AI | Standard answer set programming (ASP) targets at solving search problems from
the first level of the polynomial time hierarchy (PH). Tackling search problems
beyond NP using ASP is less straightforward. The class of disjunctive logic
programs offers the most prominent way of reaching the second level of the PH,
but enc... | computer science |
20,613 | Iterative Learning of Answer Set Programs from Context Dependent
Examples | cs.AI | In recent years, several frameworks and systems have been proposed that
extend Inductive Logic Programming (ILP) to the Answer Set Programming (ASP)
paradigm. In ILP, examples must all be explained by a hypothesis together with
a given background knowledge. In existing systems, the background knowledge is
the same for ... | computer science |
20,614 | Delta Epsilon Alpha Star: A PAC-Admissible Search Algorithm | cs.AI | Delta Epsilon Alpha Star is a minimal coverage, real-time robotic search
algorithm that yields a moderately aggressive search path with minimal
backtracking. Search performance is bounded by a placing a combinatorial bound,
epsilon and delta, on the maximum deviation from the theoretical shortest path
and the probabili... | computer science |
20,615 | Proceedings of the Second Summer School on Argumentation: Computational
and Linguistic Perspectives (SSA'16) | cs.AI | This volume contains the thesis abstracts presented at the Second Summer
School on Argumentation: Computational and Linguistic Perspectives (SSA'2016)
held on September 8-12 in Potsdam, Germany. | computer science |
20,616 | ASP for Minimal Entailment in a Rational Extension of SROEL | cs.AI | In this paper we exploit Answer Set Programming (ASP) for reasoning in a
rational extension SROEL-R-T of the low complexity description logic SROEL,
which underlies the OWL EL ontology language. In the extended language, a
typicality operator T is allowed to define concepts T(C) (typical C's) under a
rational semantics... | computer science |
20,617 | Mouse Movement and Probabilistic Graphical Models Based E-Learning
Activity Recognition Improvement Possibilistic Model | cs.AI | Automatically recognizing the e-learning activities is an important task for
improving the online learning process. Probabilistic graphical models such as
hidden Markov models and conditional random fields have been successfully used
in order to identify a Web users activity. For such models, the sequences of
observati... | computer science |
20,618 | Exact Structure Learning of Bayesian Networks by Optimal Path Extension | cs.AI | Bayesian networks are probabilistic graphical models often used in big data
analytics. The problem of exact structure learning is to find a network
structure that is optimal under certain scoring criteria. The problem is known
to be NP-hard and the existing methods are both computationally and memory
intensive. In this... | computer science |
20,619 | Resolving Spatial-Time Conflicts In A Set Of Any-angle Or
Angle-constrained Grid Paths | cs.AI | We study the multi-agent path finding problem (MAPF) for a group of agents
which are allowed to move into arbitrary directions on a 2D square grid. We
focus on centralized conflict resolution for independently computed plans. We
propose an algorithm that eliminates conflicts by using local re-planning and
introducing t... | computer science |
20,620 | Perceptual Reward Functions | cs.AI | Reinforcement learning problems are often described through rewards that
indicate if an agent has completed some task. This specification can yield
desirable behavior, however many problems are difficult to specify in this
manner, as one often needs to know the proper configuration for the agent. When
humans are learni... | computer science |
20,621 | Informal Physical Reasoning Processes | cs.AI | A fundamental question is whether Turing machines can model all reasoning
processes. We introduce an existence principle stating that the perception of
the physical existence of any Turing program can serve as a physical causation
for the application of any Turing-computable function to this Turing program.
The existen... | computer science |
20,622 | Open Problem: Approximate Planning of POMDPs in the class of Memoryless
Policies | cs.AI | Planning plays an important role in the broad class of decision theory.
Planning has drawn much attention in recent work in the robotics and sequential
decision making areas. Recently, Reinforcement Learning (RL), as an
agent-environment interaction problem, has brought further attention to
planning methods. Generally ... | computer science |
20,623 | Practical optimal experiment design with probabilistic programs | cs.AI | Scientists often run experiments to distinguish competing theories. This
requires patience, rigor, and ingenuity - there is often a large space of
possible experiments one could run. But we need not comb this space by hand -
if we represent our theories as formal models and explicitly declare the space
of experiments, ... | computer science |
20,624 | Effective Multi-step Temporal-Difference Learning for Non-Linear
Function Approximation | cs.AI | Multi-step temporal-difference (TD) learning, where the update targets
contain information from multiple time steps ahead, is one of the most popular
forms of TD learning for linear function approximation. The reason is that
multi-step methods often yield substantially better performance than their
single-step counter-... | computer science |
20,625 | Implementing a Relevance Tracker Module | cs.AI | PC(ID) extends propositional logic with inductive definitions: rule sets
under the well-founded semantics. Recently, a notion of relevance was
introduced for this language. This notion determines the set of undecided
literals that can still influence the satisfiability of a PC(ID) formula in a
given partial assignment.... | computer science |
20,626 | The languages of actions, formal grammars and qualitive modeling of
companies | cs.AI | In this paper we discuss methods of using the language of actions, formal
languages, and grammars for qualitative conceptual linguistic modeling of
companies as technological and human institutions. The main problem following
the discussion is the problem to find and describe a language structure for
external and inter... | computer science |
20,627 | Effectiveness of greedily collecting items in open world games | cs.AI | Since Pokemon Go sent millions on the quest of collecting virtual monsters,
an important question has been on the minds of many people: Is going after the
closest item first a time-and-cost-effective way to play? Here, we show that
this is in fact a good strategy which performs on average only 7% worse than
the best po... | computer science |
20,628 | Five dimensions of reasoning in the wild | cs.AI | Reasoning does not work well when done in isolation from its significance,
both to the needs and interests of an agent and with respect to the wider
world. Moreover, those issues may best be handled with a new sort of data
structure that goes beyond the knowledge base and incorporates aspects of
perceptual knowledge an... | computer science |
20,629 | Expressibility of norms in temporal logic | cs.AI | In this short note we address the issue of expressing norms (such as
obligations and prohibitions) in temporal logic. In particular, we address the
argument from [Governatori 2015] that norms cannot be expressed in Linear Time
Temporal Logic (LTL). | computer science |
20,630 | Effect of Incomplete Meta-dataset on Average Ranking Method | cs.AI | One of the simplest metalearning methods is the average ranking method. This
method uses metadata in the form of test results of a given set of algorithms
on given set of datasets and calculates an average rank for each algorithm. The
ranks are used to construct the average ranking. We investigate the problem of
how th... | computer science |
20,631 | A Parallel Memory-efficient Epistemic Logic Program Solver: Harder,
Better, Faster | cs.AI | As the practical use of answer set programming (ASP) has grown with the
development of efficient solvers, we expect a growing interest in extensions of
ASP as their semantics stabilize and solvers supporting them mature. Epistemic
Specifications, which adds modal operators K and M to the language of ASP, is
one such ex... | computer science |
20,632 | State Duration and Interval Modeling in Hidden Semi-Markov Model for
Sequential Data Analysis | cs.AI | Sequential data modeling and analysis have become indispensable tools for
analyzing sequential data such as time-series data because a larger amount of
sensed event data have become available. These methods capture the sequential
structure of data of interest, such as input- output relationship and
correlation among da... | computer science |
20,633 | Is a good offensive always the best defense? | cs.AI | A checkers-like model game with a simplified set of rules is studied through
extensive simulations of agents with different expertise and strategies. The
introduction of complementary strategies, in a quite general way, provides a
tool to mimic the basic ingredients of a wide scope of real games. We find that
only for ... | computer science |
20,634 | On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs | cs.AI | The goal of our research was to enhance local search heuristics used to
construct Latin Hypercube Designs. First, we introduce the \textit{1D-move}
perturbation to improve the space exploration performed by these algorithms.
Second, we propose a new evaluation function $\psi_{p,\sigma}$ specifically
targeting the Maxim... | computer science |
20,635 | The Movie Graph Argument Revisited | cs.AI | In this paper, we reexamine the Movie Graph Argument, which demonstrates a
basic incompatibility between computationalism and materialism. We discover
that the incompatibility is only manifest in singular classical-like universes.
If we accept that we live in a Multiverse, then the incompatibility goes away,
but in tha... | computer science |
20,636 | Data Analytics using Ontologies of Management Theories: Towards
Implementing 'From Theory to Practice' | cs.AI | We explore how computational ontologies can be impactful vis-a-vis the
developing discipline of "data science." We posit an approach wherein
management theories are represented as formal axioms, and then applied to draw
inferences about data that reside in corporate databases. That is, management
theories would be impl... | computer science |
20,637 | Event Selection Rules to Compute Explanations | cs.AI | Explanations have been introduced in the previous century. Their interest in
reducing the search space is no longer questioned. Yet, their efficient
implementation into CSP solver is still a challenge. In this paper, we
introduce ESeR, an Event Selection Rules algorithm that filters events
generated during propagation.... | computer science |
20,638 | From Deterministic ODEs to Dynamic Structural Causal Models | cs.AI | We show how, under certain conditions, the asymptotic behaviour of an
Ordinary Differential Equation under non-constant interventions can be modelled
using Dynamic Structural Causal Models. In contrast to earlier work, we study
not only the effect of interventions on equilibrium states; rather, we model
asymptotic beha... | computer science |
20,639 | A Novel Approach to Multimedia Ontology Engineering for Automated
Reasoning over Audiovisual LOD Datasets | cs.AI | Multimedia reasoning, which is suitable for, among others, multimedia content
analysis and high-level video scene interpretation, relies on the formal and
comprehensive conceptualization of the represented knowledge domain. However,
most multimedia ontologies are not exhaustive in terms of role definitions, and
do not ... | computer science |
20,640 | Achievements in Answer Set Programming (Preliminary Report) | cs.AI | This paper describes an approach to the methodology of answer set programming
(ASP) that can facilitate the design of encodings that are easy to understand
and provably correct. Under this approach, after appending a rule or a small
group of rules to the emerging program we include a comment that states what
has been "... | computer science |
20,641 | Vicious Circle Principle and Formation of Sets in ASP Based Languages | cs.AI | The paper continues the investigation of Poincare and Russel's Vicious Circle
Principle (VCP) in the context of the design of logic programming languages
with sets. We expand previously introduced language Alog with aggregates by
allowing infinite sets and several additional set related constructs useful for
knowledge ... | computer science |
20,642 | BreakID: Static Symmetry Breaking for ASP (System Description) | cs.AI | Symmetry breaking has been proven to be an efficient preprocessing technique
for satisfiability solving (SAT). In this paper, we port the state-of-the-art
SAT symmetry breaker BreakID to answer set programming (ASP). The result is a
lightweight tool that can be plugged in between the grounding and the solving
phases th... | computer science |
20,643 | PDDL+ Planning via Constraint Answer Set Programming | cs.AI | PDDL+ is an extension of PDDL that enables modelling planning domains with
mixed discrete-continuous dynamics. In this paper we present a new approach to
PDDL+ planning based on Constraint Answer Set Programming (CASP), i.e. ASP
rules plus numerical constraints. To the best of our knowledge, ours is the
first attempt t... | computer science |
20,644 | A case study of algorithm selection for the traveling thief problem | cs.AI | Many real-world problems are composed of several interacting components. In
order to facilitate research on such interactions, the Traveling Thief Problem
(TTP) was created in 2013 as the combination of two well-understood
combinatorial optimization problems.
With this article, we contribute in four ways. First, we c... | computer science |
20,645 | A MIP Backend for the IDP System | cs.AI | The IDP knowledge base system currently uses MiniSAT(ID) as its backend
Constraint Programming (CP) solver. A few similar systems have used a Mixed
Integer Programming (MIP) solver as backend. However, so far little is known
about when the MIP solver is preferable. This paper explores this question. It
describes the us... | computer science |
20,646 | Unifying task specification in reinforcement learning | cs.AI | Reinforcement learning tasks are typically specified as Markov decision
processes. This formalism has been highly successful, though specifications
often couple the dynamics of the environment and the learning objective. This
lack of modularity can complicate generalization of the task specification, as
well as obfusca... | computer science |
20,647 | Random Shuffling and Resets for the Non-stationary Stochastic Bandit
Problem | cs.AI | We consider a non-stationary formulation of the stochastic multi-armed bandit
where the rewards are no longer assumed to be identically distributed. For the
best-arm identification task, we introduce a version of Successive Elimination
based on random shuffling of the $K$ arms. We prove that under a novel and mild
assu... | computer science |
20,648 | Latent Dependency Forest Models | cs.AI | Probabilistic modeling is one of the foundations of modern machine learning
and artificial intelligence. In this paper, we propose a novel type of
probabilistic models named latent dependency forest models (LDFMs). A LDFM
models the dependencies between random variables with a forest structure that
can change dynamical... | computer science |
20,649 | Towards Better Response Times and Higher-Quality Queries in Interactive
Knowledge Base Debugging | cs.AI | Many AI applications rely on knowledge encoded in a locigal knowledge base
(KB). The most essential benefit of such logical KBs is the opportunity to
perform automatic reasoning which however requires a KB to meet some minimal
quality criteria such as consistency. Without adequate tool assistance, the
task of resolving... | computer science |
20,650 | Some Advances in Role Discovery in Graphs | cs.AI | Role discovery in graphs is an emerging area that allows analysis of complex
graphs in an intuitive way. In contrast to other graph prob- lems such as
community discovery, which finds groups of highly connected nodes, the role
discovery problem finds groups of nodes that share similar graph topological
structure. Howev... | computer science |
20,651 | Relational Models | cs.AI | We provide a survey on relational models. Relational models describe complete
networked {domains by taking into account global dependencies in the data}.
Relational models can lead to more accurate predictions if compared to
non-relational machine learning approaches. Relational models typically are
based on probabilis... | computer science |
20,652 | DESPOT: Online POMDP Planning with Regularization | cs.AI | The partially observable Markov decision process (POMDP) provides a
principled general framework for planning under uncertainty, but solving POMDPs
optimally is computationally intractable, due to the "curse of dimensionality"
and the "curse of history". To overcome these challenges, we introduce the
Determinized Spars... | computer science |
20,653 | Graph Aggregation | cs.AI | Graph aggregation is the process of computing a single output graph that
constitutes a good compromise between several input graphs, each provided by a
different source. One needs to perform graph aggregation in a wide variety of
situations, e.g., when applying a voting rule (graphs as preference orders),
when consolid... | computer science |
20,654 | Instrumenting an SMT Solver to Solve Hybrid Network Reachability
Problems | cs.AI | PDDL+ planning has its semantics rooted in hybrid automata (HA) and recent
work has shown that it can be modeled as a network of HAs. Addressing the
complexity of nonlinear PDDL+ planning as HAs requires both space and time
efficient reasoning. Unfortunately, existing solvers either do not address
nonlinear dynamics or... | computer science |
20,655 | Sequencing Chess | cs.AI | We analyze the structure of the state space of chess by means of transition
path sampling Monte Carlo simulation. Based on the typical number of moves
required to transpose a given configuration of chess pieces into another, we
conclude that the state space consists of several pockets between which
transitions are rare... | computer science |
20,656 | NPCs as People, Too: The Extreme AI Personality Engine | cs.AI | PK Dick once asked "Do Androids Dream of Electric Sheep?" In video games, a
similar question could be asked of non-player characters: Do NPCs have dreams?
Can they live and change as humans do? Can NPCs have personalities, and can
these develop through interactions with players, other NPCs, and the world
around them? D... | computer science |
20,657 | The Option-Critic Architecture | cs.AI | Temporal abstraction is key to scaling up learning and planning in
reinforcement learning. While planning with temporally extended actions is well
understood, creating such abstractions autonomously from data has remained
challenging. We tackle this problem in the framework of options [Sutton, Precup
& Singh, 1999; Pre... | computer science |
20,658 | Should Terminology Principles be re-examined? | cs.AI | Operationalization of terminology for IT applications has revived the
Wusterian approach. The conceptual dimension once more prevails after taking
back seat to specialised lexicography. This is demonstrated by the emergence of
ontology in terminology. While the Terminology Principles as defined in Felber
manual and the... | computer science |
20,659 | Prioritised Default Logic as Argumentation with Partial Order Default
Priorities | cs.AI | We express Brewka's prioritised default logic (PDL) as argumentation using
ASPIC+. By representing PDL as argumentation and designing an argument
preference relation that takes the argument structure into account, we prove
that the conclusions of the justified arguments correspond to the PDL
extensions. We will first a... | computer science |
20,660 | Label-Free Supervision of Neural Networks with Physics and Domain
Knowledge | cs.AI | In many machine learning applications, labeled data is scarce and obtaining
more labels is expensive. We introduce a new approach to supervising neural
networks by specifying constraints that should hold over the output space,
rather than direct examples of input-output pairs. These constraints are
derived from prior d... | computer science |
20,661 | Preorder-Based Triangle: A Modified Version of Bilattice-Based Triangle
for Belief Revision in Nonmonotonic Reasoning | cs.AI | Bilattice-based triangle provides an elegant algebraic structure for
reasoning with vague and uncertain information. But the truth and knowledge
ordering of intervals in bilattice-based triangle can not handle repetitive
belief revisions which is an essential characteristic of nonmonotonic
reasoning. Moreover the order... | computer science |
20,662 | On the adoption of abductive reasoning for time series interpretation | cs.AI | Time series interpretation aims to provide an explanation of what is observed
in terms of its underlying processes. The present work is based on the
assumption that common classification-based approaches to time series
interpretation suffer from a set of inherent weaknesses whose ultimate cause
lies in the monotonic na... | computer science |
20,663 | TODIM and TOPSIS with Z-numbers | cs.AI | In this paper, we present an approach that is able to handle with Z-numbers
in the context of Multi-Criteria Decision Making (MCDM) problems. Z-numbers are
composed of two parts, the first one is a restriction on the values that can be
assumed, and the second part is the reliability of the information. As human
beings ... | computer science |
20,664 | A Theory of Interactive Debugging of Knowledge Bases in Monotonic Logics | cs.AI | A broad variety of knowledge-based applications such as recommender, expert,
planning or configuration systems usually operate on the basis of knowledge
represented by means of some logical language. Such a logical knowledge base
(KB) enables intelligent behavior of such systems by allowing them to
automatically reason... | computer science |
20,665 | The Digital Synaptic Neural Substrate: Size and Quality Matters | cs.AI | We investigate the 'Digital Synaptic Neural Substrate' (DSNS) computational
creativity approach further with respect to the size and quality of images that
can be used to seed the process. In previous work we demonstrated how combining
photographs of people and sequences taken from chess games between weak players
can ... | computer science |
20,666 | NdFluents: A Multi-dimensional Contexts Ontology | cs.AI | Annotating semantic data with metadata is becoming more and more important to
provide information about the statements being asserted. While initial
solutions proposed a data model to represent a specific dimension of
meta-information (such as time or provenance), the need for a general
annotation framework which allow... | computer science |
20,667 | Commonsense reasoning, commonsense knowledge, and the SP theory of
intelligence | cs.AI | This paper describes how the "SP theory of intelligence", outlined in an
Appendix, may throw light on aspects of commonsense reasoning (CSR) and
commonsense knowledge (CSK) (together shortened to CSRK), as discussed in
another paper by Ernest Davis and Gary Marcus (DM). The SP system has the
generality needed for CSRK:... | computer science |
20,668 | Model-based Test Generation for Robotic Software: Automata versus
Belief-Desire-Intention Agents | cs.AI | Robotic code needs to be verified to ensure its safety and functional
correctness, especially when the robot is interacting with people. Testing real
code in simulation is a viable option. However, generating tests that cover
rare scenarios, as well as exercising most of the code, is a challenge
amplified by the comple... | computer science |
20,669 | A computer program for simulating time travel and a possible 'solution'
for the grandfather paradox | cs.AI | While the possibility of time travel in physics is still debated, the
explosive growth of virtual-reality simulations opens up new possibilities to
rigorously explore such time travel and its consequences in the digital domain.
Here we provide a computational model of time travel and a computer program
that allows expl... | computer science |
20,670 | UbuntuWorld 1.0 LTS - A Platform for Automated Problem Solving &
Troubleshooting in the Ubuntu OS | cs.AI | In this paper, we present UbuntuWorld 1.0 LTS - a platform for developing
automated technical support agents in the Ubuntu operating system.
Specifically, we propose to use the Bash terminal as a simulator of the Ubuntu
environment for a learning-based agent and demonstrate the usefulness of
adopting reinforcement lear... | computer science |
20,671 | Global Constraint Catalog, Volume II, Time-Series Constraints | cs.AI | First this report presents a restricted set of finite transducers used to
synthesise structural time-series constraints described by means of a
multi-layered function composition scheme. Second it provides the corresponding
synthesised catalogue of structural time-series constraints where each
constraint is explicitly ... | computer science |
20,672 | Heuristic with elements of tabu search for Truck and Trailer Routing
Problem | cs.AI | Vehicle Routing Problem is a well-known problem in logistics and
transportation, and the variety of such problems is explained by the fact that
it occurs in many real-life situations. It is an NP-hard combinatorial
optimization problem and finding an exact optimal solution is practically
impossible. In this work, Site-... | computer science |
20,673 | Characterization of experts in crowdsourcing platforms | cs.AI | Crowdsourcing platforms enable to propose simple human intelligence tasks to
a large number of participants who realise these tasks. The workers often
receive a small amount of money or the platforms include some other incentive
mechanisms, for example they can increase the workers reputation score, if they
complete th... | computer science |
20,674 | Improving Accuracy and Scalability of the PC Algorithm by Maximizing
P-value | cs.AI | A number of attempts have been made to improve accuracy and/or scalability of
the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010;
Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add
here one more tool to the toolbox: the simple observation that if one is forced
to choo... | computer science |
20,675 | A Probability Distribution Strategy with Efficient Clause Selection for
Hard Max-SAT Formulas | cs.AI | Many real-world problems involving constraints can be regarded as instances
of the Max-SAT problem, which is the optimization variant of the classic
satisfiability problem. In this paper, we propose a novel probabilistic
approach for Max-SAT called ProMS. Our algorithm relies on a stochastic local
search strategy using... | computer science |
20,676 | Phase-Mapper: An AI Platform to Accelerate High Throughput Materials
Discovery | cs.AI | High-Throughput materials discovery involves the rapid synthesis,
measurement, and characterization of many different but structurally-related
materials. A key problem in materials discovery, the phase map identification
problem, involves the determination of the crystal phase diagram from the
materials' composition an... | computer science |
20,677 | Towards the Design of Prospect-Theory based Human Decision Rules for
Hypothesis Testing | cs.AI | Detection rules have traditionally been designed for rational agents that
minimize the Bayes risk (average decision cost). With the advent of
crowd-sensing systems, there is a need to redesign binary hypothesis testing
rules for behavioral agents, whose cognitive behavior is not captured by
traditional utility function... | computer science |
20,678 | The Predictive Context Tree: Predicting Contexts and Interactions | cs.AI | With a large proportion of people carrying location-aware smartphones, we
have an unprecedented platform from which to understand individuals and predict
their future actions. This work builds upon the Context Tree data structure
that summarises the historical contexts of individuals from augmented
geospatial trajector... | computer science |
20,679 | Lifted Message Passing for the Generalized Belief Propagation | cs.AI | We introduce the lifted Generalized Belief Propagation (GBP) message passing
algorithm, for the computation of sum-product queries in Probabilistic
Relational Models (e.g. Markov logic network). The algorithm forms a compact
region graph and establishes a modified version of message passing, which
mimics the GBP behavi... | computer science |
20,680 | Learning Macro-actions for State-Space Planning | cs.AI | Planning has achieved significant progress in recent years. Among the various
approaches to scale up plan synthesis, the use of macro-actions has been widely
explored. As a first stage towards the development of a solution to learn
on-line macro-actions, we propose an algorithm to identify useful macro-actions
based on... | computer science |
20,681 | Solving Marginal MAP Problems with NP Oracles and Parity Constraints | cs.AI | Arising from many applications at the intersection of decision making and
machine learning, Marginal Maximum A Posteriori (Marginal MAP) Problems unify
the two main classes of inference, namely maximization (optimization) and
marginal inference (counting), and are believed to have higher complexity than
both of them. W... | computer science |
20,682 | Multi-Objective Deep Reinforcement Learning | cs.AI | We propose Deep Optimistic Linear Support Learning (DOL) to solve
high-dimensional multi-objective decision problems where the relative
importances of the objectives are not known a priori. Using features from the
high-dimensional inputs, DOL computes the convex coverage set containing all
potential optimal solutions o... | computer science |
20,683 | Situational Awareness by Risk-Conscious Skills | cs.AI | Hierarchical Reinforcement Learning has been previously shown to speed up the
convergence rate of RL planning algorithms as well as mitigate feature-based
model misspecification (Mankowitz et. al. 2016a,b, Bacon 2015). To do so, it
utilizes hierarchical abstractions, also known as skills -- a type of
temporally extende... | computer science |
20,684 | ABA+: Assumption-Based Argumentation with Preferences | cs.AI | We present ABA+, a new approach to handling preferences in a well known
structured argumentation formalism, Assumption-Based Argumentation (ABA). In
ABA+, preference information given over assumptions is incorporated directly
into the attack relation, thus resulting in attack reversal. ABA+
conservatively extends ABA a... | computer science |
20,685 | A Chain-Detection Algorithm for Two-Dimensional Grids | cs.AI | We describe a general method of detecting valid chains or links of pieces on
a two-dimensional grid. Specifically, using the example of the chess variant
known as Switch-Side Chain-Chess (SSCC). Presently, no foolproof method of
detecting such chains in any given chess position is known and existing graph
theory, to ou... | computer science |
20,686 | A fuzzy expert system for earthquake prediction, case study: the Zagros
range | cs.AI | A methodology for the development of a fuzzy expert system (FES) with
application to earthquake prediction is presented. The idea is to reproduce the
performance of a human expert in earthquake prediction. To do this, at the
first step, rules provided by the human expert are used to generate a fuzzy
rule base. These ru... | computer science |
20,687 | Improved Knowledge Base Completion by Path-Augmented TransR Model | cs.AI | Knowledge base completion aims to infer new relations from existing
information. In this paper, we propose path-augmented TransR (PTransR) model to
improve the accuracy of link prediction. In our approach, we base PTransR model
on TransR, which is the best one-hop model at present. Then we regularize
TransR with inform... | computer science |
20,688 | Improvements in Sub-optimal Solving of the $(N^2-1)$-Puzzle via Joint
Relocation of Pebbles and its Applications to Rule-based Cooperative
Path-Finding | cs.AI | The problem of solving $(n^2-1)$-puzzle and cooperative path-finding (CPF)
sub-optimally by rule based algorithms is addressed in this manuscript. The
task in the puzzle is to rearrange $n^2-1$ pebbles on the square grid of the
size of n x n using one vacant position to a desired goal configuration. An
improvement to t... | computer science |
20,689 | VRPBench: A Vehicle Routing Benchmark Tool | cs.AI | The number of optimization techniques in the combinatorial domain is large
and diversified. Nevertheless, there is still a lack of real benchmarks to
validate optimization algorithms. In this work we introduce VRPBench, a tool to
create instances and visualize solutions to the Vehicle Routing Problem (VRP)
in a planar ... | computer science |
20,690 | Makespan Optimal Solving of Cooperative Path-Finding via Reductions to
Propositional Satisfiability | cs.AI | The problem of makespan optimal solving of cooperative path finding (CPF) is
addressed in this paper. The task in CPF is to relocate a group of agents in a
non-colliding way so that each agent eventually reaches its goal location from
the given initial location. The abstraction adopted in this work assumes that
agents ... | computer science |
20,691 | Identifiability and Transportability in Dynamic Causal Networks | cs.AI | In this paper we propose a causal analog to the purely observational Dynamic
Bayesian Networks, which we call Dynamic Causal Networks. We provide a sound
and complete algorithm for identification of Dynamic Causal Net- works, namely,
for computing the effect of an intervention or experiment, based on passive
observatio... | computer science |
20,692 | Constrained Cohort Intelligence using Static and Dynamic Penalty
Function Approach for Mechanical Components Design | cs.AI | Most of the metaheuristics can efficiently solve unconstrained problems;
however, their performance may degenerate if the constraints are involved. This
paper proposes two constraint handling approaches for an emerging metaheuristic
of Cohort Intelligence (CI). More specifically CI with static penalty function
approach... | computer science |
20,693 | Generalized Interval-valued OWA Operators with Interval Weights Derived
from Interval-valued Overlap Functions | cs.AI | In this work we extend to the interval-valued setting the notion of an
overlap functions and we discuss a method which makes use of interval-valued
overlap functions for constructing OWA operators with interval-valued weights.
. Some properties of interval-valued overlap functions and the derived
interval-valued OWA op... | computer science |
20,694 | An Ensemble of Adaptive Neuro-Fuzzy Kohonen Networks for Online Data
Stream Fuzzy Clustering | cs.AI | A new approach to data stream clustering with the help of an ensemble of
adaptive neuro-fuzzy systems is proposed. The proposed ensemble is formed with
adaptive neuro-fuzzy self-organizing Kohonen maps in a parallel processing
mode. A final result is chosen by the best neuro-fuzzy self-organizing Kohonen
map. | computer science |
20,695 | KGEval: Estimating Accuracy of Automatically Constructed Knowledge
Graphs | cs.AI | Automatic construction of large knowledge graphs (KG) by mining web-scale
text datasets has received considerable attention recently. Estimating accuracy
of such automatically constructed KGs is a challenging problem due to their
size and diversity. This important problem has largely been ignored in prior
research we f... | computer science |
20,696 | pg-Causality: Identifying Spatiotemporal Causal Pathways for Air
Pollutants with Urban Big Data | cs.AI | Many countries are suffering from severe air pollution. Understanding how
different air pollutants accumulate and propagate is critical to making
relevant public policies. In this paper, we use urban big data (air quality
data and meteorological data) to identify the \emph{spatiotemporal (ST) causal
pathways} for air p... | computer science |
20,697 | Characterization of an inconsistency ranking for pairwise comparison
matrices | cs.AI | Pairwise comparisons between alternatives are a well-known method for
measuring preferences of a decision-maker. Since these often do not exhibit
consistency, a number of inconsistency indices has been introduced in order to
measure the deviation from this ideal case. We axiomatically characterize the
inconsistency ran... | computer science |
20,698 | Balancing Suspense and Surprise: Timely Decision Making with Endogenous
Information Acquisition | cs.AI | We develop a Bayesian model for decision-making under time pressure with
endogenous information acquisition. In our model, the decision maker decides
when to observe (costly) information by sampling an underlying continuous-time
stochastic process (time series) that conveys information about the potential
occurrence or... | computer science |
20,699 | Intelligence in Artificial Intelligence | cs.AI | The elusive quest for intelligence in artificial intelligence prompts us to
consider that instituting human-level intelligence in systems may be (still) in
the realm of utopia. In about a quarter century, we have witnessed the winter
of AI (1990) being transformed and transported to the zenith of tabloid fodder
about A... | computer science |
20,700 | Process Discovery using Inductive Miner and Decomposition | cs.AI | This report presents a submission to the Process Discovery Contest. The
contest is dedicated to the assessment of tools and techniques that discover
business process models from event logs. The objective is to compare the
efficiency of techniques to discover process models that provide a proper
balance between "overfit... | computer science |
20,701 | A self-tuning Firefly algorithm to tune the parameters of Ant Colony
System (ACSFA) | cs.AI | Ant colony system (ACS) is a promising approach which has been widely used in
problems such as Travelling Salesman Problems (TSP), Job shop scheduling
problems (JSP) and Quadratic Assignment problems (QAP). In its original
implementation, parameters of the algorithm were selected by trial and error
approach. Over the l... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.