Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
20,702 | A Review of 40 Years of Cognitive Architecture Research: Core Cognitive
Abilities and Practical Applications | cs.AI | In this paper we present a broad overview of the last 40 years of research on
cognitive architectures. Although the number of existing architectures is
nearing several hundred, most of the existing surveys do not reflect this
growth and focus on a handful of well-established architectures. Thus, in this
survey we wante... | computer science |
20,703 | Anomaly Detection with the Voronoi Diagram Evolutionary Algorithm | cs.AI | This paper presents the Voronoi diagram-based evolutionary algorithm
(VorEAl). VorEAl partitions input space in abnormal/normal subsets using
Voronoi diagrams. Diagrams are evolved using a multi-objective bio-inspired
approach in order to conjointly optimize classification metrics while also
being able to represent are... | computer science |
20,704 | Personalized Risk Scoring for Critical Care Prognosis using Mixtures of
Gaussian Processes | cs.AI | Objective: In this paper, we develop a personalized real-time risk scoring
algorithm that provides timely and granular assessments for the clinical acuity
of ward patients based on their (temporal) lab tests and vital signs; the
proposed risk scoring system ensures timely intensive care unit (ICU)
admissions for clinic... | computer science |
20,705 | Identifying Unknown Unknowns in the Open World: Representations and
Policies for Guided Exploration | cs.AI | Predictive models deployed in the real world may assign incorrect labels to
instances with high confidence. Such errors or unknown unknowns are rooted in
model incompleteness, and typically arise because of the mismatch between
training data and the cases encountered at test time. As the models are blind
to such errors... | computer science |
20,706 | Multi-agent projective simulation: A starting point | cs.AI | We develop a two-defender (Alice and Bob) invasion game using the method of
projective simulation as an embodied model for artificial intelligence. We hope
that it will be the first step towards the effect of perception on different
actions in a given game. As a given perception of a given situation, the agent,
say Ali... | computer science |
20,707 | Local Subspace-Based Outlier Detection using Global Neighbourhoods | cs.AI | Outlier detection in high-dimensional data is a challenging yet important
task, as it has applications in, e.g., fraud detection and quality control.
State-of-the-art density-based algorithms perform well because they 1) take the
local neighbourhoods of data points into account and 2) consider feature
subspaces. In hig... | computer science |
20,708 | Inferring Coupling of Distributed Dynamical Systems via Transfer Entropy | cs.AI | In this work, we are interested in structure learning for a set of spatially
distributed dynamical systems, where individual subsystems are coupled via
latent variables and observed through a filter. We represent this model as a
directed acyclic graph (DAG) that characterises the unidirectional coupling
between subsyst... | computer science |
20,709 | Strong Neutrosophic Graphs and Subgraph Topological Subspaces | cs.AI | In this book authors for the first time introduce the notion of strong
neutrosophic graphs. They are very different from the usual graphs and
neutrosophic graphs. Using these new structures special subgraph topological
spaces are defined. Further special lattice graph of subgraphs of these graphs
are defined and descri... | computer science |
20,710 | A Framework for Searching for General Artificial Intelligence | cs.AI | There is a significant lack of unified approaches to building generally
intelligent machines. The majority of current artificial intelligence research
operates within a very narrow field of focus, frequently without considering
the importance of the 'big picture'. In this document, we seek to describe and
unify princip... | computer science |
20,711 | Probabilistic Modeling of Progressive Filtering | cs.AI | Progressive filtering is a simple way to perform hierarchical classification,
inspired by the behavior that most humans put into practice while attempting to
categorize an item according to an underlying taxonomy. Each node of the
taxonomy being associated with a different category, one may visualize the
categorization... | computer science |
20,712 | Bayesian Non-parametric model to Target Gamification Notifications Using
Big Data | cs.AI | I suggest an approach that helps the online marketers to target their
Gamification elements to users by modifying the order of the list of tasks that
they send to users. It is more realistic and flexible as it allows the model to
learn more parameters when the online marketers collect more data. The
targeting approach ... | computer science |
20,713 | Proceedings of the First International Workshop on Argumentation in
Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016) | cs.AI | This volume contains the papers presented at Arg-LPNMR 2016: First
International Workshop on Argumentation in Logic Programming and Nonmonotonic
Reasoning held on July 8-10, 2016 in New York City, NY. | computer science |
20,714 | The Data Complexity of Description Logic Ontologies | cs.AI | We analyze the data complexity of ontology-mediated querying where the
ontologies are formulated in a description logic (DL) of the ALC family and
queries are conjunctive queries, positive existential queries, or acyclic
conjunctive queries. Our approach is non-uniform in the sense that we aim to
understand the complex... | computer science |
20,715 | On interestingness measures of formal concepts | cs.AI | Formal concepts and closed itemsets proved to be of big importance for
knowledge discovery, both as a tool for concise representation of association
rules and a tool for clustering and constructing domain taxonomies and
ontologies. Exponential explosion makes it difficult to consider the whole
concept lattice arising f... | computer science |
20,716 | Encoding monotonic multi-set preferences using CI-nets: preliminary
report | cs.AI | CP-nets and their variants constitute one of the main AI approaches for
specifying and reasoning about preferences. CI-nets, in particular, are a
CP-inspired formalism for representing ordinal preferences over sets of goods,
which are typically required to be monotonic.
Considering also that goods often come in multi... | computer science |
20,717 | XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained
Problems | cs.AI | We propose a major revision of the format XCSP 2.1, called XCSP3, to build
integrated representations of combinatorial constrained problems. This new
format is able to deal with mono/multi optimization, many types of variables,
cost functions, reification, views, annotations, variable quantification,
distributed, proba... | computer science |
20,718 | A Review on Algorithms for Constraint-based Causal Discovery | cs.AI | Causal discovery studies the problem of mining causal relationships between
variables from data, which is of primary interest in science. During the past
decades, significant amount of progresses have been made toward this
fundamental data mining paradigm. Recent years, as the availability of abundant
large-sized and c... | computer science |
20,719 | Commonsense Knowledge Enhanced Embeddings for Solving Pronoun
Disambiguation Problems in Winograd Schema Challenge | cs.AI | In this paper, we propose commonsense knowledge enhanced embeddings (KEE) for
solving the Pronoun Disambiguation Problems (PDP). The PDP task we investigate
in this paper is a complex coreference resolution task which requires the
utilization of commonsense knowledge. This task is a standard first round test
set in the... | computer science |
20,720 | Learning for Expertise Matching with Declination Prediction | cs.AI | We study the problem of finding appropriate experts who are able to complete
timely reviews and would not say "no" to the invitation. The problem is a
central issue in many question-and-answer systems, but has received little
research attention. Different from most existing studies that focus on
expertise matching, we ... | computer science |
20,721 | Driving CDCL Search | cs.AI | The CDCL algorithm is the leading solution adopted by state-of-the-art
solvers for SAT, SMT, ASP, and others. Experiments show that the performance of
CDCL solvers can be significantly boosted by embedding domain-specific
heuristics, especially on large real-world problems. However, a proper
integration of such criteri... | computer science |
20,722 | Optimal Dynamic Coverage Infrastructure for Large-Scale Fleets of
Reconnaissance UAVs | cs.AI | Current state of the art in the field of UAV activation relies solely on
human operators for the design and adaptation of the drones' flying routes.
Furthermore, this is being done today on an individual level (one vehicle per
operators), with some exceptions of a handful of new systems, that are
comprised of a small n... | computer science |
20,723 | Fast Non-Parametric Tests of Relative Dependency and Similarity | cs.AI | We introduce two novel non-parametric statistical hypothesis tests. The first
test, called the relative test of dependency, enables us to determine whether
one source variable is significantly more dependent on a first target variable
or a second. Dependence is measured via the Hilbert-Schmidt Independence
Criterion (H... | computer science |
20,724 | Navigational Rule Derivation: An algorithm to determine the effect of
traffic signs on road networks | cs.AI | In this paper we present an algorithm to build a road network map enriched
with traffic rules such as one-way streets and forbidden turns, based on the
interpretation of already detected and classified traffic signs. Such algorithm
helps to automatize the elaboration of maps for commercial navigation systems.
Our solut... | computer science |
20,725 | Stratified Knowledge Bases as Interpretable Probabilistic Models
(Extended Abstract) | cs.AI | In this paper, we advocate the use of stratified logical theories for
representing probabilistic models. We argue that such encodings can be more
interpretable than those obtained in existing frameworks such as Markov logic
networks. Among others, this allows for the use of domain experts to improve
learned models by d... | computer science |
20,726 | An unexpected unity among methods for interpreting model predictions | cs.AI | Understanding why a model made a certain prediction is crucial in many data
science fields. Interpretable predictions engender appropriate trust and
provide insight into how the model may be improved. However, with large modern
datasets the best accuracy is often achieved by complex models even experts
struggle to inte... | computer science |
20,727 | A Spatio-Temporal Representation for the Orienteering Problem with
Time-Varying Profits | cs.AI | We consider an orienteering problem (OP) where an agent needs to visit a
series (possibly a subset) of depots, from which the maximal accumulated
profits are desired within given limited time budget. Different from most
existing works where the profits are assumed to be static, in this work we
investigate a variant tha... | computer science |
20,728 | Double-quantitative $γ^{\ast}-$fuzzy coverings approximation
operators | cs.AI | In digital-based information boom, the fuzzy covering rough set model is an
important mathematical tool for artificial intelligence, and how to build the
bridge between the fuzzy covering rough set theory and Pawlak's model is
becoming a hot research topic. In this paper, we first present the
$\gamma-$fuzzy covering ba... | computer science |
20,729 | The Off-Switch Game | cs.AI | It is clear that one of the primary tools we can use to mitigate the
potential risk from a misbehaving AI system is the ability to turn the system
off. As the capabilities of AI systems improve, it is important to ensure that
such systems do not adopt subgoals that prevent a human from switching them
off. This is a cha... | computer science |
20,730 | Decision Support Systems in Fisheries and Aquaculture: A systematic
review | cs.AI | Decision support systems help decision makers make better decisions in the
face of complex decision problems (e.g. investment or policy decisions).
Fisheries and Aquaculture is a domain where decision makers face such decisions
since they involve factors from many different scientific fields. No systematic
overview of ... | computer science |
20,731 | An Analysis of Tournament Structure | cs.AI | This paper explores a novel way for analyzing the tournament structures to
find a best suitable one for the tournament under consideration. It concerns
about three aspects such as tournament conducting cost, competitiveness
development and ranking precision. It then proposes a new method using progress
tree to detect p... | computer science |
20,732 | New Trends in Neutrosophic Theory and Applications | cs.AI | Neutrosophic theory and applications have been expanding in all directions at
an astonishing rate especially after the introduction the journal entitled
Neutrosophic Sets and Systems. New theories, techniques, algorithms have been
rapidly developed. One of the most striking trends in the neutrosophic theory
is the hybr... | computer science |
20,733 | Bipolar Weighted Argumentation Graphs | cs.AI | This paper discusses the semantics of weighted argumentation graphs that are
biplor, i.e. contain both attacks and support graphs. The work builds on
previous work by Amgoud, Ben-Naim et. al., which presents and compares several
semantics for argumentation graphs that contain only supports or only attacks
relationships... | computer science |
20,734 | "Model and Run" Constraint Networks with a MILP Engine | cs.AI | Constraint Programming (CP) users need significant expertise in order to
model their problems appropriately, notably to select propagators and search
strategies. This puts the brakes on a broader uptake of CP. In this paper, we
introduce MICE, a complete Java CP modeler that can use any Mixed Integer
Linear Programming... | computer science |
20,735 | Nonparametric General Reinforcement Learning | cs.AI | Reinforcement learning (RL) problems are often phrased in terms of Markov
decision processes (MDPs). In this thesis we go beyond MDPs and consider RL in
environments that are non-Markovian, non-ergodic and only partially observable.
Our focus is not on practical algorithms, but rather on the fundamental
underlying prob... | computer science |
20,736 | Adams Conditioning and Likelihood Ratio Transfer Mediated Inference | cs.AI | Forensic science advocates the use of inference mechanisms which may be
viewed as simple multi-agent protocols. An important protocol of this kind
involves an agent FE (forensic expert) who communicates to a second agent TOF
(trier of fact) first its value of a certain likelihood ratio with respect to
its own belief st... | computer science |
20,737 | STRIPS Planning in Infinite Domains | cs.AI | Many robotic planning applications involve continuous actions with highly
non-linear constraints, which cannot be modeled using modern planners that
construct a propositional representation. We introduce STRIPStream: an
extension of the STRIPS language which can model these domains by supporting
the specification of bl... | computer science |
20,738 | An affective computational model for machine consciousness | cs.AI | In the past, several models of consciousness have become popular and have led
to the development of models for machine consciousness with varying degrees of
success and challenges for simulation and implementations. Moreover, affective
computing attributes that involve emotions, behavior and personality have not
been t... | computer science |
20,739 | Conceptual Spaces for Cognitive Architectures: A Lingua Franca for
Different Levels of Representation | cs.AI | During the last decades, many cognitive architectures (CAs) have been
realized adopting different assumptions about the organization and the
representation of their knowledge level. Some of them (e.g. SOAR [Laird
(2012)]) adopt a classical symbolic approach, some (e.g. LEABRA [O'Reilly and
Munakata (2000)]) are based o... | computer science |
20,740 | Finding Risk-Averse Shortest Path with Time-dependent Stochastic Costs | cs.AI | In this paper, we tackle the problem of risk-averse route planning in a
transportation network with time-dependent and stochastic costs. To solve this
problem, we propose an adaptation of the A* algorithm that accommodates any
risk measure or decision criterion that is monotonic with first-order
stochastic dominance. W... | computer science |
20,741 | From Preference-Based to Multiobjective Sequential Decision-Making | cs.AI | In this paper, we present a link between preference-based and multiobjective
sequential decision-making. While transforming a multiobjective problem to a
preference-based one is quite natural, the other direction is a bit less
obvious. We present how this transformation (from preference-based to
multiobjective) can be ... | computer science |
20,742 | Fuzzy finite element model updating using metaheuristic optimization
algorithms | cs.AI | In this paper, a non-probabilistic method based on fuzzy logic is used to
update finite element models (FEMs). Model updating techniques use the measured
data to improve the accuracy of numerical models of structures. However, the
measured data are contaminated with experimental noise and the models are
inaccurate due ... | computer science |
20,743 | A K-fold Method for Baseline Estimation in Policy Gradient Algorithms | cs.AI | The high variance issue in unbiased policy-gradient methods such as VPG and
REINFORCE is typically mitigated by adding a baseline. However, the baseline
fitting itself suffers from the underfitting or the overfitting problem. In
this paper, we develop a K-fold method for baseline estimation in policy
gradient algorithm... | computer science |
20,744 | Stochastic Planning and Lifted Inference | cs.AI | Lifted probabilistic inference (Poole, 2003) and symbolic dynamic programming
for lifted stochastic planning (Boutilier et al, 2001) were introduced around
the same time as algorithmic efforts to use abstraction in stochastic systems.
Over the years, these ideas evolved into two distinct lines of research, each
support... | computer science |
20,745 | DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker | cs.AI | Artificial intelligence has seen several breakthroughs in recent years, with
games often serving as milestones. A common feature of these games is that
players have perfect information. Poker is the quintessential game of imperfect
information, and a longstanding challenge problem in artificial intelligence.
We introdu... | computer science |
20,746 | Stoic Ethics for Artificial Agents | cs.AI | We present a position paper advocating the notion that Stoic philosophy and
ethics can inform the development of ethical A.I. systems. This is in sharp
contrast to most work on building ethical A.I., which has focused on
Utilitarian or Deontological ethical theories. We relate ethical A.I. to
several core Stoic notions... | computer science |
20,747 | Predicting Citywide Crowd Flows Using Deep Spatio-Temporal Residual
Networks | cs.AI | Forecasting the flow of crowds is of great importance to traffic management
and public safety, and very challenging as it is affected by many complex
factors, including spatial dependencies (nearby and distant), temporal
dependencies (closeness, period, trend), and external conditions (e.g., weather
and events). We pro... | computer science |
20,748 | IoFClime: The fuzzy logic and the Internet of Things to control indoor
temperature regarding the outdoor ambient conditions | cs.AI | The Internet of Things is arriving to our homes or cities through fields
already known like Smart Homes, Smart Cities, or Smart Towns. The monitoring of
environmental conditions of cities can help to adapt the indoor locations of
the cities in order to be more comfortable for people who stay there. A way to
improve the... | computer science |
20,749 | A Framework for Knowledge Management and Automated Reasoning Applied on
Intelligent Transport Systems | cs.AI | Cyber-Physical Systems in general, and Intelligent Transport Systems (ITS) in
particular use heterogeneous data sources combined with problem solving
expertise in order to make critical decisions that may lead to some form of
actions e.g., driver notifications, change of traffic light signals and braking
to prevent an ... | computer science |
20,750 | Towards Smart Proof Search for Isabelle | cs.AI | Despite the recent progress in automatic theorem provers, proof engineers are
still suffering from the lack of powerful proof automation. In this position
paper we first report our proof strategy language based on a meta-tool
approach. Then, we propose an AI-based approach to drastically improve proof
automation for Is... | computer science |
20,751 | From First-Order Logic to Assertional Logic | cs.AI | First-Order Logic (FOL) is widely regarded as one of the most important
foundations for knowledge representation. Nevertheless, in this paper, we argue
that FOL has several critical issues for this purpose. Instead, we propose an
alternative called assertional logic, in which all syntactic objects are
categorized as se... | computer science |
20,752 | A Savage-Like Axiomatization for Nonstandard Expected Utility | cs.AI | Since Leonard Savage's epoch-making "Foundations of Statistics", Subjective
Expected Utility Theory has been the presumptive model for decision-making.
Savage provided an act-based axiomatization of standard expected utility
theory. In this article, we provide a Savage-like axiomatization of nonstandard
expected utilit... | computer science |
20,753 | Fuzzy Clustering Data Given in the Ordinal Scale | cs.AI | A fuzzy clustering algorithm for multidimensional data is proposed in this
article. The data is described by vectors whose components are linguistic
variables defined in an ordinal scale. The obtained results confirm the
efficiency of the proposed approach. | computer science |
20,754 | On the links between argumentation-based reasoning and nonmonotonic
reasoning | cs.AI | In this paper we investigate the links between instantiated argumentation
systems and the axioms for non-monotonic reasoning described in [9] with the
aim of characterising the nature of argument based reasoning. In doing so, we
consider two possible interpretations of the consequence relation, and describe
which axiom... | computer science |
20,755 | Minimally Naturalistic Artificial Intelligence | cs.AI | The rapid advancement of machine learning techniques has re-energized
research into general artificial intelligence. While the idea of
domain-agnostic meta-learning is appealing, this emerging field must come to
terms with its relationship to human cognition and the statistics and structure
of the tasks humans perform.... | computer science |
20,756 | Multiobjective Optimization of Solar Powered Irrigation System with
Fuzzy Type-2 Noise Modelling | cs.AI | Optimization is becoming a crucial element in industrial applications
involving sustainable alternative energy systems. During the design of such
systems, the engineer/decision maker would often encounter noise factors (e.g.
solar insolation and ambient temperature fluctuations) when their system
interacts with the env... | computer science |
20,757 | Intrinsically Motivated Acquisition of Modular Slow Features for
Humanoids in Continuous and Non-Stationary Environments | cs.AI | A compact information-rich representation of the environment, also called a
feature abstraction, can simplify a robot's task of mapping its raw sensory
inputs to useful action sequences. However, in environments that are
non-stationary and only partially observable, a single abstraction is probably
not sufficient to en... | computer science |
20,758 | Ontology based system to guide internship assignment process | cs.AI | Internship assignment is a complicated process for universities since it is
necessary to take into account a multiplicity of variables to establish a
compromise between companies' requirements and student competencies acquired
during the university training. These variables build up a complex relations
map that require... | computer science |
20,759 | Reasoning in Non-Probabilistic Uncertainty: Logic Programming and
Neural-Symbolic Computing as Examples | cs.AI | This article aims to achieve two goals: to show that probability is not the
only way of dealing with uncertainty (and even more, that there are kinds of
uncertainty which are for principled reasons not addressable with probabilistic
means); and to provide evidence that logic-based methods can well support
reasoning wit... | computer science |
20,760 | Heterogeneous Information Network Embedding for Meta Path based
Proximity | cs.AI | A network embedding is a representation of a large graph in a low-dimensional
space, where vertices are modeled as vectors. The objective of a good embedding
is to preserve the proximity between vertices in the original graph. This way,
typical search and mining methods can be applied in the embedded space with the
hel... | computer science |
20,761 | Interactive Learning from Policy-Dependent Human Feedback | cs.AI | For agents and robots to become more useful, they must be able to quickly
learn from non-technical users. This paper investigates the problem of
interactively learning behaviors communicated by a human teacher using positive
and negative feedback. Much previous work on this problem has made the
assumption that people p... | computer science |
20,762 | Binary Matrix Guessing Problem | cs.AI | We introduce the Binary Matrix Guessing Problem and provide two algorithms to
solve this problem. The first algorithm we introduce is Elementwise Probing
Algorithm (EPA) which is very fast under a score which utilizes Frobenius
Distance. The second algorithm is Additive Reinforcement Learning Algorithm
which combines i... | computer science |
20,763 | Constraint programming for planning test campaigns of communications
satellites | cs.AI | The payload of communications satellites must go through a series of tests to
assert their ability to survive in space. Each test involves some equipment of
the payload to be active, which has an impact on the temperature of the
payload. Sequencing these tests in a way that ensures the thermal stability of
the payload ... | computer science |
20,764 | Space-Time Graph Modeling of Ride Requests Based on Real-World Data | cs.AI | This paper focuses on modeling ride requests and their variations over
location and time, based on analyzing extensive real-world data from a
ride-sharing service. We introduce a graph model that captures the spatial and
temporal variability of ride requests and the potentials for ride pooling. We
discover these ride r... | computer science |
20,765 | Imitating Driver Behavior with Generative Adversarial Networks | cs.AI | The ability to accurately predict and simulate human driving behavior is
critical for the development of intelligent transportation systems. Traditional
modeling methods have employed simple parametric models and behavioral cloning.
This paper adopts a method for overcoming the problem of cascading errors
inherent in p... | computer science |
20,766 | Logic Programming Petri Nets | cs.AI | With the purpose of modeling, specifying and reasoning in an integrated
fashion with procedural and declarative aspects (both commonly present in cases
or scenarios), the paper introduces Logic Programming Petri Nets (LPPN), an
extension to the Petri Net notation providing an interface to logic programming
constructs. ... | computer science |
20,767 | Practical Reasoning with Norms for Autonomous Software Agents (Full
Edition) | cs.AI | Autonomous software agents operating in dynamic environments need to
constantly reason about actions in pursuit of their goals, while taking into
consideration norms which might be imposed on those actions. Normative
practical reasoning supports agents making decisions about what is best for
them to (not) do in a given... | computer science |
20,768 | Plan Explanations as Model Reconciliation: Moving Beyond Explanation as
Soliloquy | cs.AI | When AI systems interact with humans in the loop, they are often called on to
provide explanations for their plans and behavior. Past work on plan
explanations primarily involved the AI system explaining the correctness of its
plan and the rationale for its decision in terms of its own model. Such
soliloquy is wholly i... | computer science |
20,769 | Survey on Models and Techniques for Root-Cause Analysis | cs.AI | Automation and computer intelligence to support complex human decisions
becomes essential to manage large and distributed systems in the Cloud and IoT
era. Understanding the root cause of an observed symptom in a complex system
has been a major problem for decades. As industry dives into the IoT world and
the amount of... | computer science |
20,770 | Redefinition of the concept of fuzzy set based on vague partition from
the perspective of axiomatization | cs.AI | Based on the in-depth analysis of the essence and features of vague
phenomena, this paper focuses on establishing the axiomatical foundation of
membership degree theory for vague phenomena, presents an axiomatic system to
govern membership degrees and their interconnections. On this basis, the
concept of vague partitio... | computer science |
20,771 | Diversification Methods for Zero-One Optimization | cs.AI | We introduce new diversification methods for zero-one optimization that
significantly extend strategies previously introduced in the setting of
metaheuristic search. Our methods incorporate easily implemented strategies for
partitioning assignments of values to variables, accompanied by processes
called augmentation an... | computer science |
20,772 | Expert Level control of Ramp Metering based on Multi-task Deep
Reinforcement Learning | cs.AI | This article shows how the recent breakthroughs in Reinforcement Learning
(RL) that have enabled robots to learn to play arcade video games, walk or
assemble colored bricks, can be used to perform other tasks that are currently
at the core of engineering cyberphysical systems. We present the first use of
RL for the con... | computer science |
20,773 | Interaction Information for Causal Inference: The Case of Directed
Triangle | cs.AI | Interaction information is one of the multivariate generalizations of mutual
information, which expresses the amount information shared among a set of
variables, beyond the information, which is shared in any proper subset of
those variables. Unlike (conditional) mutual information, which is always
non-negative, intera... | computer science |
20,774 | On the Semantics and Complexity of Probabilistic Logic Programs | cs.AI | We examine the meaning and the complexity of probabilistic logic programs
that consist of a set of rules and a set of independent probabilistic facts
(that is, programs based on Sato's distribution semantics). We focus on two
semantics, respectively based on stable and on well-founded models. We show
that the semantics... | computer science |
20,775 | A Hybrid Evolutionary Algorithm Based on Solution Merging for the
Longest Arc-Preserving Common Subsequence Problem | cs.AI | The longest arc-preserving common subsequence problem is an NP-hard
combinatorial optimization problem from the field of computational biology.
This problem finds applications, in particular, in the comparison of
arc-annotated Ribonucleic acid (RNA) sequences. In this work we propose a
simple, hybrid evolutionary algor... | computer science |
20,776 | Procedural Content Generation via Machine Learning (PCGML) | cs.AI | This survey explores Procedural Content Generation via Machine Learning
(PCGML), defined as the generation of game content using machine learning
models trained on existing content. As the importance of PCG for game
development increases, researchers explore new avenues for generating
high-quality content with or witho... | computer science |
20,777 | The Value of Inferring the Internal State of Traffic Participants for
Autonomous Freeway Driving | cs.AI | Safe interaction with human drivers is one of the primary challenges for
autonomous vehicles. In order to plan driving maneuvers effectively, the
vehicle's control system must infer and predict how humans will behave based on
their latent internal state (e.g., intentions and aggressiveness). This
research uses a simple... | computer science |
20,778 | Survey of modern Fault Diagnosis methods in networks | cs.AI | With the advent of modern computer networks, fault diagnosis has been a focus
of research activity. This paper reviews the history of fault diagnosis in
networks and discusses the main methods in information gathering section,
information analyzing section and diagnosing and revolving section of fault
diagnosis in netw... | computer science |
20,779 | ASHACL: Alternative Shapes Constraint Language | cs.AI | ASHACL, a variant of the W3C Shapes Constraint Language, is designed to
determine whether an RDF graph meets some conditions. These conditions are
grouped into shapes, which validate whether particular RDF terms each meet the
constraints of the shape. Shapes are themselves expressed as RDF triples in an
RDF graph, call... | computer science |
20,780 | Extracting Lifted Mutual Exclusion Invariants from Temporal Planning
Domains | cs.AI | We present a technique for automatically extracting mutual exclusion
invariants from temporal planning instances. It first identifies a set of
invariant templates by inspecting the lifted representation of the domain and
then checks these templates against properties that assure invariance. Our
technique builds on othe... | computer science |
20,781 | Autonomous Braking System via Deep Reinforcement Learning | cs.AI | In this paper, we propose a new autonomous braking system based on deep
reinforcement learning. The proposed autonomous braking system automatically
decides whether to apply the brake at each time step when confronting the risk
of collision using the information on the obstacle obtained by the sensors. The
problem of d... | computer science |
20,782 | Propagation via Kernelization: The Vertex Cover Constraint | cs.AI | The technique of kernelization consists in extracting, from an instance of a
problem, an essentially equivalent instance whose size is bounded in a
parameter k. Besides being the basis for efficient param-eterized algorithms,
this method also provides a wealth of information to reason about in the
context of constraint... | computer science |
20,783 | A Minimax Algorithm Better Than Alpha-beta?: No and Yes | cs.AI | This paper has three main contributions to our understanding of fixed-depth
minimax search: (A) A new formulation for Stockman's SSS* algorithm, based on
Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS*,
finally transforming it into a practical algorithm. In effect, we show that
SSS* = alpha-beta... | computer science |
20,784 | Graph Neural Networks and Boolean Satisfiability | cs.AI | In this paper we explore whether or not deep neural architectures can learn
to classify Boolean satisfiability (SAT). We devote considerable time to
discussing the theoretical properties of SAT. Then, we define a graph
representation for Boolean formulas in conjunctive normal form, and train
neural classifiers over gen... | computer science |
20,785 | Genetic and Memetic Algorithm with Diversity Equilibrium based on Greedy
Diversification | cs.AI | The lack of diversity in a genetic algorithm's population may lead to a bad
performance of the genetic operators since there is not an equilibrium between
exploration and exploitation. In those cases, genetic algorithms present a fast
and unsuitable convergence.
In this paper we develop a novel hybrid genetic algorit... | computer science |
20,786 | On Seeking Consensus Between Document Similarity Measures | cs.AI | This paper investigates the application of consensus clustering and
meta-clustering to the set of all possible partitions of a data set. We show
that when using a "complement" of Rand Index as a measure of cluster
similarity, the total-separation partition, putting each element in a separate
set, is chosen. | computer science |
20,787 | Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter | cs.AI | Researchers in answer set programming and constraint programming have spent
significant efforts in the development of hybrid languages and solving
algorithms combining the strengths of these traditionally separate fields.
These efforts resulted in a new research area: constraint answer set
programming. Constraint answe... | computer science |
20,788 | T-SKIRT: Online Estimation of Student Proficiency in an Adaptive
Learning System | cs.AI | We develop T-SKIRT: a temporal, structured-knowledge, IRT-based method for
predicting student responses online. By explicitly accounting for student
learning and employing a structured, multidimensional representation of student
proficiencies, the model outperforms standard IRT-based methods on an online
response predi... | computer science |
20,789 | Entropy Non-increasing Games for the Improvement of Dataflow Programming | cs.AI | In this article, we introduce a new conception of a family of esport games
called Samu Entropy to try to improve dataflow program graphs like the ones
that are based on Google's TensorFlow. Currently, the Samu Entropy project
specifies only requirements for new esport games to be developed with
particular attention to ... | computer science |
20,790 | Local Search for Minimum Weight Dominating Set with Two-Level
Configuration Checking and Frequency Based Scoring Function | cs.AI | The Minimum Weight Dominating Set (MWDS) problem is an important
generalization of the Minimum Dominating Set (MDS) problem with extensive
applications. This paper proposes a new local search algorithm for the MWDS
problem, which is based on two new ideas. The first idea is a heuristic called
two-level configuration ch... | computer science |
20,791 | Theorem Proving Based on Semantics of DNA Strand Graph | cs.AI | Because of several technological limitations of traditional silicon based
computing, for past few years a paradigm shift, from silicon to carbon, is
occurring in computational world. DNA computing has been considered to be quite
promising in solving computational and reasoning problems by using DNA strands.
Resolution,... | computer science |
20,792 | The Dialog State Tracking Challenge with Bayesian Approach | cs.AI | Generative model has been one of the most common approaches for solving the
Dialog State Tracking Problem with the capabilities to model the dialog
hypotheses in an explicit manner. The most important task in such Bayesian
networks models is constructing the most reliable user models by learning and
reflecting the trai... | computer science |
20,793 | An Integer Programming Model for Binary Knapsack Problem with
Value-Related Dependencies among Elements | cs.AI | Binary Knapsack Problem (BKP) is to select a subset of an element (item) set
with the highest value while keeping the total weight within the capacity of
the knapsack. This paper presents an integer programming model for a variation
of BKP where the value of each element may depend on selecting or ignoring
other elemen... | computer science |
20,794 | Solving DCOPs with Distributed Large Neighborhood Search | cs.AI | The field of Distributed Constraint Optimization has gained momentum in
recent years, thanks to its ability to address various applications related to
multi-agent cooperation. Nevertheless, solving Distributed Constraint
Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale,
complex applications... | computer science |
20,795 | Theoretical and Experimental Analysis of the Canadian Traveler Problem | cs.AI | Devising an optimal strategy for navigation in a partially observable
environment is one of the key objectives in AI. One of the problem in this
context is the Canadian Traveler Problem (CTP). CTP is a navigation problem
where an agent is tasked to travel from source to target in a partially
observable weighted graph, ... | computer science |
20,796 | A DIKW Paradigm to Cognitive Engineering | cs.AI | Though the word cognitive has a wide range of meanings we define cognitive
engineering as learning from brain to bolster engineering solutions. However,
giving an achievable framework to the process towards this has been a difficult
task. In this work we take the classic data information knowledge wisdom (DIKW)
framewo... | computer science |
20,797 | Embedding Knowledge Graphs Based on Transitivity and Antisymmetry of
Rules | cs.AI | Representation learning of knowledge graphs encodes entities and relation
types into a continuous low-dimensional vector space, learns embeddings of
entities and relation types. Most existing methods only concentrate on
knowledge triples, ignoring logic rules which contain rich background
knowledge. Although there has ... | computer science |
20,798 | Synergistic Team Composition | cs.AI | Effective teams are crucial for organisations, especially in environments
that require teams to be constantly created and dismantled, such as software
development, scientific experiments, crowd-sourcing, or the classroom. Key
factors influencing team performance are competences and personality of team
members. Hence, w... | computer science |
20,799 | Differentiable Learning of Logical Rules for Knowledge Base Reasoning | cs.AI | We study the problem of learning probabilistic first-order logical rules for
knowledge base reasoning. This learning problem is difficult because it
requires learning the parameters in a continuous space as well as the structure
in a discrete space. We propose a framework, Neural Logic Programming, that
combines the pa... | computer science |
20,800 | Don't Fear the Reaper: Refuting Bostrom's Superintelligence Argument | cs.AI | In recent years prominent intellectuals have raised ethical concerns about
the consequences of artificial intelligence. One concern is that an autonomous
agent might modify itself to become "superintelligent" and, in supremely
effective pursuit of poorly specified goals, destroy all of humanity. This
paper considers an... | computer science |
20,801 | HolStep: A Machine Learning Dataset for Higher-order Logic Theorem
Proving | cs.AI | Large computer-understandable proofs consist of millions of intermediate
logical steps. The vast majority of such steps originate from manually selected
and manually guided heuristics applied to intermediate goals. So far, machine
learning has generally not been used to filter or generate these steps. In this
paper, we... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.