Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
20,302 | Variable Elimination in the Fourier Domain | cs.AI | The ability to represent complex high dimensional probability distributions
in a compact form is one of the key insights in the field of graphical models.
Factored representations are ubiquitous in machine learning and lead to major
computational advantages. We explore a different type of compact representation
based o... | computer science |
20,303 | The SP theory of intelligence: distinctive features and advantages | cs.AI | This paper highlights distinctive features of the "SP theory of intelligence"
and its apparent advantages compared with some AI-related alternatives.
Distinctive features and advantages are: simplification and integration of
observations and concepts; simplification and integration of structures and
processes in comput... | computer science |
20,304 | Learning Modulo Theories for preference elicitation in hybrid domains | cs.AI | This paper introduces CLEO, a novel preference elicitation algorithm capable
of recommending complex objects in hybrid domains, characterized by both
discrete and continuous attributes and constraints defined over them. The
algorithm assumes minimal initial information, i.e., a set of catalog
attributes, and defines de... | computer science |
20,305 | Proposal for the creation of a research facility for the development of
the SP machine | cs.AI | This is a proposal to create a research facility for the development of a
high-parallel version of the "SP machine", based on the "SP theory of
intelligence". We envisage that the new version of the SP machine will be an
open-source software virtual machine, derived from the existing "SP computer
model", and hosted on ... | computer science |
20,306 | Drawing and Analyzing Causal DAGs with DAGitty | cs.AI | DAGitty is a software for drawing and analyzing causal diagrams, also known
as directed acyclic graphs (DAGs). Functions include identification of minimal
sufficient adjustment sets for estimating causal effects, diagnosis of
insufficient or invalid adjustment via the identification of biasing paths,
identification of ... | computer science |
20,307 | Warehouse Layout Method Based on Ant Colony and Backtracking Algorithm | cs.AI | Warehouse is one of the important aspects of a company. Therefore, it is
necessary to improve Warehouse Management System (WMS) to have a simple
function that can determine the layout of the storage goods. In this paper we
propose an improved warehouse layout method based on ant colony algorithm and
backtracking algori... | computer science |
20,308 | Efficient Computation of Exact IRV Margins | cs.AI | The margin of victory is easy to compute for many election schemes but
difficult for Instant Runoff Voting (IRV). This is important because arguments
about the correctness of an election outcome usually rely on the size of the
electoral margin. For example, risk-limiting audits require a knowledge of the
margin of vict... | computer science |
20,309 | Duration and Interval Hidden Markov Model for Sequential Data Analysis | cs.AI | Analysis of sequential event data has been recognized as one of the essential
tools in data modeling and analysis field. In this paper, after the examination
of its technical requirements and issues to model complex but practical
situation, we propose a new sequential data model, dubbed Duration and Interval
Hidden Mar... | computer science |
20,310 | A note on the complexity of the causal ordering problem | cs.AI | In this note we provide a concise report on the complexity of the causal
ordering problem, originally introduced by Simon to reason about causal
dependencies implicit in systems of mathematical equations. We show that
Simon's classical algorithm to infer causal ordering is NP-Hard---an
intractability previously guessed... | computer science |
20,311 | Using Thought-Provoking Children's Questions to Drive Artificial
Intelligence Research | cs.AI | We propose to use thought-provoking children's questions (TPCQs), namely
Highlights BrainPlay questions, as a new method to drive artificial
intelligence research and to evaluate the capabilities of general-purpose AI
systems. These questions are designed to stimulate thought and learning in
children, and they can be u... | computer science |
20,312 | The Relation Between Acausality and Interference in Quantum-Like
Bayesian Networks | cs.AI | We analyse a quantum-like Bayesian Network that puts together cause/effect
relationships and semantic similarities between events. These semantic
similarities constitute acausal connections according to the Synchronicity
principle and provide new relationships to quantum like probabilistic graphical
models. As a conseq... | computer science |
20,313 | Mining Combined Causes in Large Data Sets | cs.AI | In recent years, many methods have been developed for detecting causal
relationships in observational data. Some of them have the potential to tackle
large data sets. However, these methods fail to discover a combined cause, i.e.
a multi-factor cause consisting of two or more component variables which
individually are ... | computer science |
20,314 | Turing's Imitation Game has been Improved | cs.AI | Using the recently introduced universal computing model, called orchestrated
machine, that represents computations in a dissipative environment, we consider
a new kind of interpretation of Turing's Imitation Game. In addition we raise
the question whether the intelligence may show fractal properties. Then we
sketch a v... | computer science |
20,315 | Ontology Based SMS Controller for Smart Phones | cs.AI | Text analysis includes lexical analysis of the text and has been widely
studied and used in diverse applications. In the last decade, researchers have
proposed many efficient solutions to analyze / classify large text dataset,
however, analysis / classification of short text is still a challenge because
1) the data is ... | computer science |
20,316 | Bounded Situation Calculus Action Theories | cs.AI | In this paper, we investigate bounded action theories in the situation
calculus. A bounded action theory is one which entails that, in every
situation, the number of object tuples in the extension of fluents is bounded
by a given constant, although such extensions are in general different across
the infinitely many sit... | computer science |
20,317 | A unified heuristic and an annotated bibliography for a large class of
earliness-tardiness scheduling problems | cs.AI | This work proposes a unified heuristic algorithm for a large class of
earliness-tardiness (E-T) scheduling problems. We consider single/parallel
machine E-T problems that may or may not consider some additional features such
as idle time, setup times and release dates. In addition, we also consider
those problems whose... | computer science |
20,318 | Learning Efficient Representations for Reinforcement Learning | cs.AI | Markov decision processes (MDPs) are a well studied framework for solving
sequential decision making problems under uncertainty. Exact methods for
solving MDPs based on dynamic programming such as policy iteration and value
iteration are effective on small problems. In problems with a large discrete
state space or with... | computer science |
20,319 | A Topological Approach to Meta-heuristics: Analytical Results on the BFS
vs. DFS Algorithm Selection Problem | cs.AI | Search is a central problem in artificial intelligence, and BFS and DFS the
two most fundamental ways to search. In this report we derive results for
average BFS and DFS runtime: For tree search, we employ a probabilistic model
of goal distribution; for graph search, the analysis depends on an additional
statistic of p... | computer science |
20,320 | An Epsilon Hierarchical Fuzzy Twin Support Vector Regression | cs.AI | The research presents epsilon hierarchical fuzzy twin support vector
regression based on epsilon fuzzy twin support vector regression and epsilon
twin support vector regression. Epsilon FTSVR is achieved by incorporating
trapezoidal fuzzy numbers to epsilon TSVR which takes care of uncertainty
existing in forecasting p... | computer science |
20,321 | Measuring an Artificial Intelligence System's Performance on a Verbal IQ
Test For Young Children | cs.AI | We administered the Verbal IQ (VIQ) part of the Wechsler Preschool and
Primary Scale of Intelligence (WPPSI-III) to the ConceptNet 4 AI system. The
test questions (e.g., "Why do we shake hands?") were translated into ConceptNet
4 inputs using a combination of the simple natural language processing tools
that come with ... | computer science |
20,322 | Sharing HOL4 and HOL Light proof knowledge | cs.AI | New proof assistant developments often involve concepts similar to already
formalized ones. When proving their properties, a human can often take
inspiration from the existing formalized proofs available in other provers or
libraries. In this paper we propose and evaluate a number of methods, which
strengthen proof aut... | computer science |
20,323 | Premise Selection and External Provers for HOL4 | cs.AI | Learning-assisted automated reasoning has recently gained popularity among
the users of Isabelle/HOL, HOL Light, and Mizar. In this paper, we present an
add-on to the HOL4 proof assistant and an adaptation of the HOLyHammer system
that provides machine learning-based premise selection and automated reasoning
also for H... | computer science |
20,324 | Lazy Factored Inference for Functional Probabilistic Programming | cs.AI | Probabilistic programming provides the means to represent and reason about
complex probabilistic models using programming language constructs. Even simple
probabilistic programs can produce models with infinitely many variables.
Factored inference algorithms are widely used for probabilistic graphical
models, but canno... | computer science |
20,325 | Some Supplementaries to The Counting Semantics for Abstract
Argumentation | cs.AI | Dung's abstract argumentation framework consists of a set of interacting
arguments and a series of semantics for evaluating them. Those semantics
partition the powerset of the set of arguments into two classes: extensions and
non-extensions. In order to reason with a specific semantics, one needs to take
a credulous or... | computer science |
20,326 | Benchmarking for Bayesian Reinforcement Learning | cs.AI | In the Bayesian Reinforcement Learning (BRL) setting, agents try to maximise
the collected rewards while interacting with their environment while using some
prior knowledge that is accessed beforehand. Many BRL algorithms have already
been proposed, but even though a few toy examples exist in the literature,
there are ... | computer science |
20,327 | Causal Model Analysis using Collider v-structure with Negative
Percentage Mapping | cs.AI | A major problem of causal inference is the arrangement of dependent nodes in
a directed acyclic graph (DAG) with path coefficients and observed confounders.
Path coefficients do not provide the units to measure the strength of
information flowing from one node to the other. Here we proposed the method of
causal structu... | computer science |
20,328 | A Study Investigating Typical Concepts and Guidelines for Ontology
Building | cs.AI | In semantic technologies, the shared common understanding of the structure of
information among artifacts (people or software agents) can be realized by
building an ontology. To do this, it is imperative for an ontology builder to
answer several questions: a) what are the main components of an ontology? b)
How an ontol... | computer science |
20,329 | Poker-CNN: A Pattern Learning Strategy for Making Draws and Bets in
Poker Games | cs.AI | Poker is a family of card games that includes many variations. We hypothesize
that most poker games can be solved as a pattern matching problem, and propose
creating a strong poker playing system based on a unified poker representation.
Our poker player learns through iterative self-play, and improves its
understanding... | computer science |
20,330 | Constructing Abstraction Hierarchies Using a Skill-Symbol Loop | cs.AI | We describe a framework for building abstraction hierarchies whereby an agent
alternates skill- and representation-acquisition phases to construct a sequence
of increasingly abstract Markov decision processes. Our formulation builds on
recent results showing that the appropriate abstract representation of a
problem is ... | computer science |
20,331 | Ensemble UCT Needs High Exploitation | cs.AI | Recent results have shown that the MCTS algorithm (a new, adaptive,
randomized optimization algorithm) is effective in a remarkably diverse set of
applications in Artificial Intelligence, Operations Research, and High Energy
Physics. MCTS can find good solutions without domain dependent heuristics,
using the UCT formul... | computer science |
20,332 | On the Min-cost Traveling Salesman Problem with Drone | cs.AI | Over the past few years, unmanned aerial vehicles (UAV), also known as
drones, have been adopted as part of a new logistic method in the commercial
sector called "last-mile delivery". In this novel approach, they are deployed
alongside trucks to deliver goods to customers to improve the quality of
service and reduce th... | computer science |
20,333 | An intelligent extension of Variable Neighbourhood Search for labelling
graph problems | cs.AI | In this paper we describe an extension of the Variable Neighbourhood Search
(VNS) which integrates the basic VNS with other complementary approaches from
machine learning, statistics and experimental algorithmic, in order to produce
high-quality performance and to completely automate the resulting optimization
strategy... | computer science |
20,334 | The Computational Principles of Learning Ability | cs.AI | It has been quite a long time since AI researchers in the field of computer
science stop talking about simulating human intelligence or trying to explain
how brain works. Recently, represented by deep learning techniques, the field
of machine learning is experiencing unprecedented prosperity and some
applications with ... | computer science |
20,335 | Solving a Mathematical Problem in Square War: a Go-like Board Game | cs.AI | In this paper, we present a board game: Square War. The game definition of
Square War is similar to the classic Chinese board game Go. Then we propose a
mathematical problem of the game Square War. Finally, we show that the problem
can be solved by using a method of mixed mathematics and computer science. | computer science |
20,336 | Online Vision- and Action-Based Object Classification Using Both
Symbolic and Subsymbolic Knowledge Representations | cs.AI | If a robot is supposed to roam an environment and interact with objects, it
is often necessary to know all possible objects in advance, so that a database
with models of all objects can be generated for visual identification. However,
this constraint cannot always be fulfilled. Due to that reason, a model based
object ... | computer science |
20,337 | A Common-Factor Approach for Multivariate Data Cleaning with an
Application to Mars Phoenix Mission Data | cs.AI | Data quality is fundamentally important to ensure the reliability of data for
stakeholders to make decisions. In real world applications, such as scientific
exploration of extreme environments, it is unrealistic to require raw data
collected to be perfect. As data miners, when it is infeasible to physically
know the wh... | computer science |
20,338 | Disjunctive Answer Set Solvers via Templates | cs.AI | Answer set programming is a declarative programming paradigm oriented towards
difficult combinatorial search problems. A fundamental task in answer set
programming is to compute stable models, i.e., solutions of logic programs.
Answer set solvers are the programs that perform this task. The problem of
deciding whether ... | computer science |
20,339 | DKP-AOM: results for OAEI 2015 | cs.AI | In this paper, we present the results obtained by our DKP-AOM system within
the OAEI 2015 campaign. DKP-AOM is an ontology merging tool designed to merge
heterogeneous ontologies. In OAEI, we have participated with its ontology
mapping component which serves as a basic module capable of matching large
scale ontologies ... | computer science |
20,340 | Gelisp: A Library to Represent Musical CSPs and Search Strategies | cs.AI | In this paper we present Gelisp, a new library to represent musical
Constraint Satisfaction Problems and search strategies intuitively. Gelisp has
two interfaces, a command-line one for Common Lisp and a graphical one for
OpenMusic. Using Gelisp, we solved a problem of automatic music generation
proposed by composer Mi... | computer science |
20,341 | Artificial Intelligence and Asymmetric Information Theory | cs.AI | When human agents come together to make decisions, it is often the case that
one human agent has more information than the other. This phenomenon is called
information asymmetry and this distorts the market. Often if one human agent
intends to manipulate a decision in its favor the human agent can signal wrong
or right... | computer science |
20,342 | Data structuring for the ontological modelling of wind energy systems | cs.AI | Small wind projects encounter difficulties to be efficiently deployed, partly
because wrong way data and information are managed. Ontologies can overcome the
drawbacks of partially available, noisy, inconsistent, and heterogeneous data
sources, by providing a semantic middleware between low level data and more
general ... | computer science |
20,343 | UAVs using Bayesian Optimization to Locate WiFi Devices | cs.AI | We address the problem of localizing non-collaborative WiFi devices in a
large region. Our main motive is to localize humans by localizing their WiFi
devices, e.g. during search-and-rescue operations after a natural disaster. We
use an active sensing approach that relies on Unmanned Aerial Vehicles (UAVs)
to collect si... | computer science |
20,344 | Mathematical Foundations for Designing and Development of Intelligent
Systems of Information Analysis | cs.AI | This article is an attempt to combine different ways of working with sets of
objects and their classes for designing and development of artificial
intelligent systems (AIS) of analysis information, using object-oriented
programming (OOP). This paper contains analysis of basic concepts of OOP and
their relation with set... | computer science |
20,345 | Universal and Determined Constructors of Multisets of Objects | cs.AI | This paper contains analysis of creation of sets and multisets as an approach
for modeling of some aspects of human thinking. The creation of sets is
considered within constructive object-oriented version of set theory (COOST),
from different sides, in particular classical set theory, object-oriented
programming (OOP) ... | computer science |
20,346 | Object-Oriented Dynamic Networks | cs.AI | This paper contains description of such knowledge representation model as
Object-Oriented Dynamic Network (OODN), which gives us an opportunity to
represent knowledge, which can be modified in time, to build new relations
between objects and classes of objects and to represent results of their
modifications. The model ... | computer science |
20,347 | Exploiters-Based Knowledge Extraction in Object-Oriented Knowledge
Representation | cs.AI | This paper contains the consideration of knowledge extraction mechanisms of
such object-oriented knowledge representation models as frames, object-oriented
programming and object-oriented dynamic networks. In addition, conception of
universal exploiters within object-oriented dynamic networks is also discussed.
The mai... | computer science |
20,348 | Inheritance in Object-Oriented Knowledge Representation | cs.AI | This paper contains the consideration of inheritance mechanism in such
knowledge representation models as object-oriented programming, frames and
object-oriented dynamic networks. In addition, inheritance within
representation of vague and imprecise knowledge are also discussed. New types
of inheritance, general classi... | computer science |
20,349 | Narrative Science Systems: A Review | cs.AI | Automatic narration of events and entities is the need of the hour,
especially when live reporting is critical and volume of information to be
narrated is huge. This paper discusses the challenges in this context, along
with the algorithms used to build such systems. From a systematic study, we can
infer that most of t... | computer science |
20,350 | System Descriptions of the First International Competition on
Computational Models of Argumentation (ICCMA'15) | cs.AI | This volume contains the system description of the 18 solvers submitted to
the First International Competition on Computational Models of Argumentation
(ICCMA'15) and therefore gives an overview on state-of-the-art of computational
approaches to abstract argumentation problems. Further information on the
results of the... | computer science |
20,351 | On the Computability of AIXI | cs.AI | How could we solve the machine learning and the artificial intelligence
problem if we had infinite computation? Solomonoff induction and the
reinforcement learning agent AIXI are proposed answers to this question. Both
are known to be incomputable. In this paper, we quantify this using the
arithmetical hierarchy, and p... | computer science |
20,352 | Semantic, Cognitive, and Perceptual Computing: Advances toward Computing
for Human Experience | cs.AI | The World Wide Web continues to evolve and serve as the infrastructure for
carrying massive amounts of multimodal and multisensory observations. These
observations capture various situations pertinent to people's needs and
interests along with all their idiosyncrasies. To support human-centered
computing that empower p... | computer science |
20,353 | An Efficient Implementation for WalkSAT | cs.AI | Stochastic local search (SLS) algorithms have exhibited great effectiveness
in finding models of random instances of the Boolean satisfiability problem
(SAT). As one of the most widely known and used SLS algorithm, WalkSAT plays a
key role in the evolutions of SLS for SAT, and also hold state-of-the-art
performance on ... | computer science |
20,354 | Learning Constructive Primitives for Online Level Generation and
Real-time Content Adaptation in Super Mario Bros | cs.AI | Procedural content generation (PCG) is of great interest to game design and
development as it generates game content automatically. Motivated by the recent
learning-based PCG framework and other existing PCG works, we propose an
alternative approach to online content generation and adaptation in Super Mario
Bros (SMB).... | computer science |
20,355 | Automatic Synthesis of Geometry Problems for an Intelligent Tutoring
System | cs.AI | This paper presents an intelligent tutoring system, GeoTutor, for Euclidean
Geometry that is automatically able to synthesize proof problems and their
respective solutions given a geometric figure together with a set of properties
true of it. GeoTutor can provide personalized practice problems that address
student defi... | computer science |
20,356 | A Pareto Optimal D* Search Algorithm for Multiobjective Path Planning | cs.AI | Path planning is one of the most vital elements of mobile robotics, providing
the agent with a collision-free route through the workspace. The global path
plan can be calculated with a variety of informed search algorithms, most
notably the A* search method, guaranteed to deliver a complete and optimal
solution that mi... | computer science |
20,357 | Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The
Best Input Parameters For R* Algorithm Through Series Of Experiments | cs.AI | Path planning is typically considered in Artificial Intelligence as a graph
searching problem and R* is state-of-the-art algorithm tailored to solve it.
The algorithm decomposes given path finding task into the series of subtasks
each of which can be easily (in computational sense) solved by well-known
methods (such as... | computer science |
20,358 | Computing sets of graded attribute implications with witnessed
non-redundancy | cs.AI | In this paper we extend our previous results on sets of graded attribute
implications with witnessed non-redundancy. We assume finite residuated
lattices as structures of truth degrees and use arbitrary idempotent
truth-stressing linguistic hedges as parameters which influence the semantics
of graded attribute implicat... | computer science |
20,359 | Adaptive information-theoretic bounded rational decision-making with
parametric priors | cs.AI | Deviations from rational decision-making due to limited computational
resources have been studied in the field of bounded rationality, originally
proposed by Herbert Simon. There have been a number of different approaches to
model bounded rationality ranging from optimality principles to heuristics.
Here we take an inf... | computer science |
20,360 | An Action Language for Multi-Agent Domains: Foundations | cs.AI | In multi-agent domains (MADs), an agent's action may not just change the
world and the agent's knowledge and beliefs about the world, but also may
change other agents' knowledge and beliefs about the world and their knowledge
and beliefs about other agents' knowledge and beliefs about the world. The
goals of an agent i... | computer science |
20,361 | Learning Optimized Or's of And's | cs.AI | Or's of And's (OA) models are comprised of a small number of disjunctions of
conjunctions, also called disjunctive normal form. An example of an OA model is
as follows: If ($x_1 = $ `blue' AND $x_2=$ `middle') OR ($x_1 = $ `yellow'),
then predict $Y=1$, else predict $Y=0$. Or's of And's models have the advantage
of bei... | computer science |
20,362 | Design of an Alarm System for Isfahan Ozone Level based on Artificial
Intelligence Predictor Models | cs.AI | The ozone level prediction is an important task of air quality agencies of
modern cities. In this paper, we design an ozone level alarm system (OLP) for
Isfahan city and test it through the real word data from 1-1-2000 to 7-6-2011.
We propose a computer based system with three inputs and single output. The
inputs inclu... | computer science |
20,363 | A Winner-Take-All Approach to Emotional Neural Networks with Universal
Approximation Property | cs.AI | Here, we propose a brain-inspired winner-take-all emotional neural network
(WTAENN) and prove the universal approximation property for the novel
architecture. WTAENN is a single layered feedforward neural network that
benefits from the excitatory, inhibitory, and expandatory neural connections as
well as the winner-tak... | computer science |
20,364 | A Study of an Modeling Method of T-S fuzzy System Based on Moving Fuzzy
Reasoning and Its Application | cs.AI | To improve the effectiveness of the fuzzy identification, a structure
identification method based on moving rate is proposed for T-S fuzzy model. The
proposed method is called "T-S modeling (or T-S fuzzy identification method)
based on moving rate". First, to improve the shortcomings of existing fuzzy
reasoning methods... | computer science |
20,365 | (Yet) Another Theoretical Model of Thinking | cs.AI | This paper presents a theoretical, idealized model of the thinking process
with the following characteristics: 1) the model can produce complex thought
sequences and can be generalized to new inputs, 2) it can receive and maintain
input information indefinitely for the generation of thoughts and later use,
and 3) it su... | computer science |
20,366 | A disembodied developmental robotic agent called Samu Bátfai | cs.AI | The agent program, called Samu, is an experiment to build a disembodied
DevRob (Developmental Robotics) chatter bot that can talk in a natural language
like humans do. One of the main design feature is that Samu can be interacted
with using only a character terminal. This is important not only for practical
aspects of ... | computer science |
20,367 | Taxonomy of Pathways to Dangerous AI | cs.AI | In order to properly handle a dangerous Artificially Intelligent (AI) system
it is important to understand how the system came to be in such a state. In
popular culture (science fiction movies/books) AIs/Robots became self-aware and
as a result rebel against humanity and decide to destroy it. While it is one
possible s... | computer science |
20,368 | IBMMS Decision Support Tool For Management of Bank Telemarketing
Campaigns | cs.AI | Although direct marketing is a good method for banks to utilize in the face
of global competition and the financial crisis, it has been shown to exhibit
poor performance. However, there are some drawbacks to direct campaigns, such
as those related to improving the negative attributes that customers ascribe to
banks. To... | computer science |
20,369 | IfcWoD, Semantically Adapting IFC Model Relations into OWL Properties | cs.AI | In the context of Building Information Modelling, ontologies have been
identified as interesting in achieving information interoperability. Regarding
the construction and facility management domains, several IFC (Industry
Foundation Classes) based ontologies have been developed, such as IfcOWL. In
the context of ontolo... | computer science |
20,370 | Software Agents with Concerns of their Own | cs.AI | We claim that it is possible to have artificial software agents for which
their actions and the world they inhabit have first-person or intrinsic
meanings. The first-person or intrinsic meaning of an entity to a system is
defined as its relation with the system's goals and capabilities, given the
properties of the envi... | computer science |
20,371 | ICON Challenge on Algorithm Selection | cs.AI | We present the results of the ICON Challenge on Algorithm Selection. | computer science |
20,372 | Introduzione all'Intelligenza Artificiale | cs.AI | The paper presents an introduction to Artificial Intelligence (AI) in an
accessible and informal but precise form. The paper focuses on the algorithmic
aspects of the discipline, presenting the main techniques used in AI systems
groped in symbolic and subsymbolic. The last part of the paper is devoted to
the discussion... | computer science |
20,373 | Discovering Underlying Plans Based on Distributed Representations of
Actions | cs.AI | Plan recognition aims to discover target plans (i.e., sequences of actions)
behind observed actions, with history plan libraries or domain models in hand.
Previous approaches either discover plans by maximally "matching" observed
actions to plan libraries, assuming target plans are from plan libraries, or
infer plans b... | computer science |
20,374 | Using Abduction in Markov Logic Networks for Root Cause Analysis | cs.AI | IT infrastructure is a crucial part in most of today's business operations.
High availability and reliability, and short response times to outages are
essential. Thus a high amount of tool support and automation in risk management
is desirable to decrease outages. We propose a new approach for calculating the
root caus... | computer science |
20,375 | Solution Repair/Recovery in Uncertain Optimization Environment | cs.AI | Operation management problems (such as Production Planning and Scheduling)
are represented and formulated as optimization models. The resolution of such
optimization models leads to solutions which have to be operated in an
organization. However, the conditions under which the optimal solution is
obtained rarely corres... | computer science |
20,376 | BIRDNEST: Bayesian Inference for Ratings-Fraud Detection | cs.AI | Review fraud is a pervasive problem in online commerce, in which fraudulent
sellers write or purchase fake reviews to manipulate perception of their
products and services. Fake reviews are often detected based on several signs,
including 1) they occur in short bursts of time; 2) fraudulent user accounts
have skewed rat... | computer science |
20,377 | Abstract Attribute Exploration with Partial Object Descriptions | cs.AI | Attribute exploration has been investigated in several studies, with
particular emphasis on the algorithmic aspects of this knowledge acquisition
method. In its basic version the method itself is rather simple and
transparent. But when background knowledge and partially described
counter-examples are admitted, it gets ... | computer science |
20,378 | What is the plausibility of probability?(revised 2003, 2015) | cs.AI | We present and examine a result related to uncertainty reasoning, namely that
a certain plausibility space of Cox's type can be uniquely embedded in a
minimal ordered field. This, although a purely mathematical result, can be
claimed to imply that every rational method to reason with uncertainty must be
based on sets o... | computer science |
20,379 | A global Constraint for mining Sequential Patterns with GAP constraint | cs.AI | Sequential pattern mining (SPM) under gap constraint is a challenging task.
Many efficient specialized methods have been developed but they are all
suffering from a lack of genericity. The Constraint Programming (CP) approaches
are not so effective because of the size of their encodings. In[7], we have
proposed the glo... | computer science |
20,380 | Beyond OWL 2 QL in OBDA: Rewritings and Approximations (Extended
Version) | cs.AI | Ontology-based data access (OBDA) is a novel paradigm facilitating access to
relational data, realized by linking data sources to an ontology by means of
declarative mappings. DL-Lite_R, which is the logic underpinning the W3C
ontology language OWL 2 QL and the current language of choice for OBDA, has
been designed wit... | computer science |
20,381 | A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small
Strategies in POMDPs | cs.AI | POMDPs are standard models for probabilistic planning problems, where an
agent interacts with an uncertain environment. We study the problem of
almost-sure reachability, where given a set of target states, the question is
to decide whether there is a policy to ensure that the target set is reached
with probability 1 (a... | computer science |
20,382 | Bayesian Network Models for Adaptive Testing | cs.AI | Computerized adaptive testing (CAT) is an interesting and promising approach
to testing human abilities. In our research we use Bayesian networks to create
a model of tested humans. We collected data from paper tests performed with
grammar school students. In this article we first provide the summary of data
used for o... | computer science |
20,383 | Some Epistemological Problems with the Knowledge Level in Cognitive
Architectures | cs.AI | This article addresses an open problem in the area of cognitive systems and
architectures: namely the problem of handling (in terms of processing and
reasoning capabilities) complex knowledge structures that can be at least
plausibly comparable, both in terms of size and of typology of the encoded
information, to the k... | computer science |
20,384 | A Stochastic Process Model of Classical Search | cs.AI | Among classical search algorithms with the same heuristic information, with
sufficient memory A* is essentially as fast as possible in finding a proven
optimal solution. However, in many situations optimal solutions are simply
infeasible, and thus search algorithms that trade solution quality for speed
are desirable. I... | computer science |
20,385 | Scaling POMDPs For Selecting Sellers in E-markets-Extended Version | cs.AI | In multiagent e-marketplaces, buying agents need to select good sellers by
querying other buyers (called advisors). Partially Observable Markov Decision
Processes (POMDPs) have shown to be an effective framework for optimally
selecting sellers by selectively querying advisors. However, current solution
methods do not s... | computer science |
20,386 | Influence diagrams for the optimization of a vehicle speed profile | cs.AI | Influence diagrams are decision theoretic extensions of Bayesian networks.
They are applied to diverse decision problems. In this paper we apply influence
diagrams to the optimization of a vehicle speed profile. We present results of
computational experiments in which an influence diagram was used to optimize
the speed... | computer science |
20,387 | Symbolic Neutrosophic Theory | cs.AI | Symbolic (or Literal) Neutrosophic Theory is referring to the use of abstract
symbols (i.e. the letters T, I, F, or their refined indexed letters Tj, Ik, Fl)
in neutrosophics. We extend the dialectical triad thesis-antithesis-synthesis
to the neutrosophic tetrad thesis-antithesis-neutrothesis-neutrosynthesis. The
we in... | computer science |
20,388 | Modeling Human Understanding of Complex Intentional Action with a
Bayesian Nonparametric Subgoal Model | cs.AI | Most human behaviors consist of multiple parts, steps, or subtasks. These
structures guide our action planning and execution, but when we observe others,
the latent structure of their actions is typically unobservable, and must be
inferred in order to learn new skills by demonstration, or to assist others in
completing... | computer science |
20,389 | A Study on Artificial Intelligence IQ and Standard Intelligent Model | cs.AI | Currently, potential threats of artificial intelligence (AI) to human have
triggered a large controversy in society, behind which, the nature of the issue
is whether the artificial intelligence (AI) system can be evaluated
quantitatively. This article analyzes and evaluates the challenges that the AI
development level ... | computer science |
20,390 | On the Min-cost Traveling Salesman Problem with Drone | cs.AI | Once known to be used exclusively in military domain, unmanned aerial
vehicles (drones) have stepped up to become a part of new logistic method in
commercial sector called "last-mile delivery". In this novel approach, small
unmanned aerial vehicles (UAV), also known as drones, are deployed alongside
with trucks to deli... | computer science |
20,391 | Knowledge Sharing in Coalitions | cs.AI | The aim of this paper is to investigate the interplay between knowledge
shared by a group of agents and its coalition ability. We investigate this
relation in the standard context of imperfect information concurrent game. We
assume that whenever a set of agents form a coalition to achieve a goal, they
share their knowl... | computer science |
20,392 | Contamination-Free Measures and Algebraic Operations | cs.AI | An open concept of rough evolution and an axiomatic approach to granules was
also developed recently by the present author. Subsequently the concepts were
used in the formal framework of rough Y-systems (RYS) for developing on
granular correspondences by her. These have since been used for a new approach
towards compar... | computer science |
20,393 | Sensitivity analysis, multilinearity and beyond | cs.AI | Sensitivity methods for the analysis of the outputs of discrete Bayesian
networks have been extensively studied and implemented in different software
packages. These methods usually focus on the study of sensitivity functions and
on the impact of a parameter change to the Chan-Darwiche distance. Although not
fully reco... | computer science |
20,394 | Learning measures of semi-additive behaviour | cs.AI | In business analytics, measure values, such as sales numbers or volumes of
cargo transported, are often summed along values of one or more corresponding
categories, such as time or shipping container. However, not every measure
should be added by default (e.g., one might more typically want a mean over the
heights of a... | computer science |
20,395 | Subsumptive reflection in SNOMED CT: a large description logic-based
terminology for diagnosis | cs.AI | Description logic (DL) based biomedical terminology (SNOMED CT) is used
routinely in medical practice. However, diagnostic inference using such
terminology is precluded by its complexity. Here we propose a model that
simplifies these inferential components. We propose three concepts that
classify clinical features and ... | computer science |
20,396 | Using Linear Constraints for Logic Program Termination Analysis | cs.AI | It is widely acknowledged that function symbols are an important feature in
answer set programming, as they make modeling easier, increase the expressive
power, and allow us to deal with infinite domains. The main issue with their
introduction is that the evaluation of a program might not terminate and
checking whether... | computer science |
20,397 | An Event Calculus Production Rule System for Reasoning in Dynamic and
Uncertain Domains | cs.AI | Action languages have emerged as an important field of Knowledge
Representation for reasoning about change and causality in dynamic domains.
This article presents Cerbere, a production system designed to perform online
causal, temporal and epistemic reasoning based on the Event Calculus. The
framework implements the de... | computer science |
20,398 | A Model for Safety Case Confidence Assessment | cs.AI | Building a safety case is a common approach to make expert judgement explicit
about safety of a system. The issue of confidence in such argumentation is
still an open research field. Providing quantitative estimation of confidence
is an interesting approach to manage complexity of arguments. This paper
explores the mai... | computer science |
20,399 | Hyper-Heuristic Algorithm for Finding Efficient Features in Diagnose of
Lung Cancer Disease | cs.AI | Background: Lung cancer was known as primary cancers and the survival rate of
cancer is about 15%. Early detection of lung cancer is the leading factor in
survival rate. All symptoms (features) of lung cancer do not appear until the
cancer spreads to other areas. It needs an accurate early detection of lung
cancer, for... | computer science |
20,400 | Conditions for Normative Decision Making at the Fire Ground | cs.AI | We discuss the changes in an attitude to decision making at the fire ground.
The changes are driven by the recent technological shift. The emerging new
approaches in sensing and data processing (under common umbrella of
Cyber-Physical Systems) allow for leveling off the gap, between humans and
machines, in perception o... | computer science |
20,401 | BayesDB: A probabilistic programming system for querying the probable
implications of data | cs.AI | Is it possible to make statistical inference broadly accessible to
non-statisticians without sacrificing mathematical rigor or inference quality?
This paper describes BayesDB, a probabilistic programming platform that aims to
enable users to query the probable implications of their data as directly as
SQL databases ena... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.