Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
37,007 | Causal inference for cloud computing | cs.AI | Cloud computing involves complex technical and economical systems and
interactions. This brings about various challenges, two of which are: (1)
debugging and control of computing systems with the help of sandbox
experiments, and (2) prediction of the cost of "spot" resources for decision
making of cloud clients. In thi... | computer science |
37,008 | An Argument-based Creative Assistant for Harmonic Blending | cs.SD | Conceptual blending is a powerful tool for computational creativity where,
for example, the properties of two harmonic spaces may be combined in a
consistent manner to produce a novel harmonic space. However, deciding about
the importance of property features in the input spaces and evaluating the
results of conceptual... | computer science |
37,009 | An Online Mechanism for Ridesharing in Autonomous Mobility-on-Demand
Systems | cs.AI | With proper management, Autonomous Mobility-on-Demand (AMoD) systems have
great potential to satisfy the transport demands of urban populations by
providing safe, convenient, and affordable ridesharing services. Meanwhile,
such systems can substantially decrease private car ownership and use, and thus
significantly red... | computer science |
37,010 | Robot Dream | cs.RO | In this position paper we present a novel 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
"night" phases of mammalian life. During the "day" phase a robotic system
stores the inbound inform... | computer science |
37,011 | Inferring Fine-grained Details on User Activities and Home Location from
Social Media: Detecting Drinking-While-Tweeting Patterns in Communities | cs.AI | Nearly all previous work on geo-locating latent states and activities from
social media confounds general discussions about activities, self-reports of
users participating in those activities at times in the past or future, and
self-reports made at the immediate time and place the activity occurs.
Activities, such as a... | computer science |
37,012 | Grounding Recursive Aggregates: Preliminary Report | cs.AI | Problem solving in Answer Set Programming consists of two steps, a first
grounding phase, systematically replacing all variables by terms, and a second
solving phase computing the stable models of the obtained ground program. An
intricate part of both phases is the treatment of aggregates, which are popular
language co... | computer science |
37,013 | A Signaling Game Approach to Databases Querying and Interaction | cs.DB | As most database users cannot precisely express their information needs, it
is challenging for database management systems to understand them. We propose a
novel formal framework for representing and understanding information needs in
database querying and exploration. Our framework considers querying as a
collaboratio... | computer science |
37,014 | Hardware Acceleration for Boolean Satisfiability Solver by Applying
Belief Propagation Algorithm | cs.AI | Boolean satisfiability (SAT) has an extensive application domain in computer
science, especially in electronic design automation applications. Circuit
synthesis, optimization, and verification problems can be solved by
transforming original problems to SAT problems. However, the SAT problem is
known as NP-complete, whi... | computer science |
37,015 | Neurally-Guided Procedural Models: Amortized Inference for Procedural
Graphics Programs using Neural Networks | cs.GR | Probabilistic inference algorithms such as Sequential Monte Carlo (SMC)
provide powerful tools for constraining procedural models in computer graphics,
but they require many samples to produce desirable results. In this paper, we
show how to create procedural models which learn how to satisfy constraints. We
augment pr... | computer science |
37,016 | An Expressive Probabilistic Temporal Logic | cs.LO | This paper argues that a combined treatment of probabilities, time and
actions is essential for an appropriate logical account of the notion of
probability; and, based on this intuition, describes an expressive
probabilistic temporal logic for reasoning about actions with uncertain
outcomes. The logic is modal and high... | computer science |
37,017 | A New Approach for Revising Logic Programs | cs.AI | Belief revision has been studied mainly with respect to background logics
that are monotonic in character. In this paper we study belief revision when
the underlying logic is non-monotonic instead--an inherently interesting
problem that is under explored. In particular, we will focus on the revision of
a body of belief... | computer science |
37,018 | Building the Signature of Set Theory Using the MathSem Program | cs.LO | Knowledge representation is a popular research field in IT. As mathematical
knowledge is most formalized, its representation is important and interesting.
Mathematical knowledge consists of various mathematical theories. In this paper
we consider a deductive system that derives mathematical notions, axioms and
theorems... | computer science |
37,019 | Reactive Policies with Planning for Action Languages | cs.AI | We describe a representation in a high-level transition system for policies
that express a reactive behavior for the agent. We consider a target decision
component that figures out what to do next and an (online) planning capability
to compute the plans needed to reach these targets. Our representation allows
one to an... | computer science |
37,020 | Characterizing Realizability in Abstract Argumentation | cs.AI | Realizability for knowledge representation formalisms studies the following
question: given a semantics and a set of interpretations, is there a knowledge
base whose semantics coincides exactly with the given interpretation set? We
introduce a general framework for analyzing realizability in abstract
dialectical framew... | computer science |
37,021 | A Self-Taught Artificial Agent for Multi-Physics Computational Model
Personalization | cs.CE | Personalization is the process of fitting a model to patient data, a critical
step towards application of multi-physics computational models in clinical
practice. Designing robust personalization algorithms is often a tedious,
time-consuming, model- and data-specific process. We propose to use artificial
intelligence c... | computer science |
37,022 | Adaptive Candidate Generation for Scalable Edge-discovery Tasks on Data
Graphs | cs.AI | Several `edge-discovery' applications over graph-based data models are known
to have worst-case quadratic time complexity in the nodes, even if the
discovered edges are sparse. One example is the generic link discovery problem
between two graphs, which has invited research interest in several communities.
Specific vers... | computer science |
37,023 | Obstacle evasion using fuzzy logic in a sliding blades problem
environment | cs.AI | This paper discusses obstacle avoidance using fuzzy logic and shortest path
algorithm. This paper also introduces the sliding blades problem and
illustrates how a drone can navigate itself through the swinging blade
obstacles while tracing a semi-optimal path and also maintaining constant
velocity | computer science |
37,024 | Movement Coordination in Human-Robot Teams: A Dynamical Systems Approach | cs.RO | In order to be effective teammates, robots need to be able to understand
high-level human behavior to recognize, anticipate, and adapt to human motion.
We have designed a new approach to enable robots to perceive human group motion
in real-time, anticipate future actions, and synthesize their own motion
accordingly. We... | computer science |
37,025 | Improving abcdSAT by At-Least-One Recently Used Clause Management
Strategy | cs.LO | We improve further the 2015 version of abcdSAT by various heuristics such as
at-least-one recently used strategy, learnt clause database approximation
reduction etc. Based on the requirement of different tracks at the SAT
Competition 2016, we develop three versions of abcdSAT: drup, inc and lim,
which participate in th... | computer science |
37,026 | The KB paradigm and its application to interactive configuration | cs.AI | The knowledge base paradigm aims to express domain knowledge in a rich formal
language, and to use this domain knowledge as a knowledge base to solve various
problems and tasks that arise in the domain by applying multiple forms of
inference. As such, the paradigm applies a strict separation of concerns
between informa... | computer science |
37,027 | Beyond knowing that: a new generation of epistemic logics | cs.AI | Epistemic logic has become a major field of philosophical logic ever since
the groundbreaking work by Hintikka (1962). Despite its various successful
applications in theoretical computer science, AI, and game theory, the
technical development of the field has been mainly focusing on the
propositional part, i.e., the pr... | computer science |
37,028 | Markov Chain methods for the bipartite Boolean quadratic programming
problem | cs.DS | We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is
an extension of the well known Boolean Quadratic Programming Problem (BQP).
Applications of the BBQP include mining discrete patterns from binary data,
approximating matrices by rank-one binary matrices, computing the cut-norm of a
matrix, and... | computer science |
37,029 | The GPU-based Parallel Ant Colony System | cs.DC | The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the
MAX-MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms
inspired by the behavior of ants. In this article we present three novel
parallel versions of the ACS for the graphics processing units (GPUs). To the
best of our k... | computer science |
37,030 | A Hierarchical Emotion Regulated Sensorimotor Model: Case Studies | cs.RO | Inspired by the hierarchical cognitive architecture and the perception-action
model (PAM), we propose that the internal status acts as a kind of
common-coding representation which affects, mediates and even regulates the
sensorimotor behaviours. These regulation can be depicted in the Bayesian
framework, that is why co... | computer science |
37,031 | Concept based Attention | cs.AI | Attention endows animals an ability to concentrate on the most relevant
information among a deluge of distractors at any given time, either through
volitionally 'top-down' biasing, or driven by automatically 'bottom-up'
saliency of stimuli, in favour of advantageous competition in neural
modulations for information pro... | computer science |
37,032 | Optimizing human-interpretable dialog management policy using Genetic
Algorithm | cs.HC | Automatic optimization of spoken dialog management policies that are robust
to environmental noise has long been the goal for both academia and industry.
Approaches based on reinforcement learning have been proved to be effective.
However, the numerical representation of dialog policy is
human-incomprehensible and diff... | computer science |
37,033 | OBDA Constraints for Effective Query Answering (Extended Version) | cs.DB | In Ontology Based Data Access (OBDA) users pose SPARQL queries over an
ontology that lies on top of relational datasources. These queries are
translated on-the-fly into SQL queries by OBDA systems. Standard SPARQL-to-SQL
translation techniques in OBDA often produce SQL queries containing redundant
joins and unions, eve... | computer science |
37,034 | High-Performance Computing for Scheduling Decision Support: A Parallel
Depth-First Search Heuristic | cs.DC | Many academic disciplines - including information systems, computer science,
and operations management - face scheduling problems as important decision
making tasks. Since many scheduling problems are NP-hard in the strong sense,
there is a need for developing solution heuristics. For scheduling problems
with setup tim... | computer science |
37,035 | On the Complexity of Connection Games | cs.CC | In this paper, we study three connection games among the most widely played:
Havannah, Twixt, and Slither. We show that determining the outcome of an
arbitrary input position is PSPACE-complete in all three cases. Our reductions
are based on the popular graph problem Generalized Geography and on Hex itself.
We also con... | computer science |
37,036 | Self-Reflective Risk-Aware Artificial Cognitive Modeling for Robot
Response to Human Behaviors | cs.RO | In order for cooperative robots ("co-robots") to respond to human behaviors
accurately and efficiently in human-robot collaboration, interpretation of
human actions, awareness of new situations, and appropriate decision making are
all crucial abilities for co-robots. For this purpose, the human behaviors
should be inte... | computer science |
37,037 | Heart Rate Variability and Respiration Signal as Diagnostic Tools for
Late Onset Sepsis in Neonatal Intensive Care Units | cs.AI | Apnea-bradycardia is one of the major clinical early indicators of late-onset
sepsis occurring in approximately 7% to 10% of all neonates and in more than
25% of very low birth weight infants in NICU. The objective of this paper was
to determine if HRV, respiration and their relationships help to diagnose
infection in ... | computer science |
37,038 | Towards information based spatiotemporal patterns as a foundation for
agent representation in dynamical systems | cs.AI | We present some arguments why existing methods for representing agents fall
short in applications crucial to artificial life. Using a thought experiment
involving a fictitious dynamical systems model of the biosphere we argue that
the metabolism, motility, and the concept of counterfactual variation should be
compatibl... | computer science |
37,039 | Anomaly Detection in XML-Structured SOAP Messages Using Tree-Based
Association Rule Mining | cs.CR | Web services are software systems designed for supporting interoperable
dynamic cross-enterprise interactions. The result of attacks to Web services
can be catastrophic and causing the disclosure of enterprises' confidential
data. As new approaches of attacking arise every day, anomaly detection systems
seem to be inva... | computer science |
37,040 | Optimal Number of Choices in Rating Contexts | cs.AI | In many settings people must give numerical scores to entities from a small
discrete set. For instance, rating physical attractiveness from 1--5 on dating
sites, or papers from 1--10 for conference reviewing. We study the problem of
understanding when using a different number of options is optimal. For
concreteness we ... | computer science |
37,041 | Elastic Solver: Balancing Solution Time and Energy Consumption | cs.AI | Combinatorial decision problems arise in many different domains such as
scheduling, routing, packing, bioinformatics, and many more. Despite recent
advances in developing scalable solvers, there are still many problems which
are often very hard to solve. Typically the most advanced solvers include
elements which are st... | computer science |
37,042 | Extracting Higher-Order Goals from the Mizar Mathematical Library | cs.LO | Certain constructs allowed in Mizar articles cannot be represented in
first-order logic but can be represented in higher-order logic. We describe a
way to obtain higher-order theorem proving problems from Mizar articles that
make use of these constructs. In particular, higher-order logic is used to
represent schemes, a... | computer science |
37,043 | Towards Bin Packing (preliminary problem survey, models with multiset
estimates) | cs.AI | The paper described a generalized integrated glance to bin packing problems
including a brief literature survey and some new problem formulations for the
cases of multiset estimates of items. A new systemic viewpoint to bin packing
problems is suggested: (a) basic element sets (item set, bin set, item subset
assigned t... | computer science |
37,044 | Probabilistic Inference Modulo Theories | cs.AI | We present SGDPLL(T), an algorithm that solves (among many other problems)
probabilistic inference modulo theories, that is, inference problems over
probabilistic models defined via a logic theory provided as a parameter
(currently, propositional, equalities on discrete sorts, and inequalities, more
specifically differ... | computer science |
37,045 | TensorFlow: A system for large-scale machine learning | cs.DC | TensorFlow is a machine learning system that operates at large scale and in
heterogeneous environments. TensorFlow uses dataflow graphs to represent
computation, shared state, and the operations that mutate that state. It maps
the nodes of a dataflow graph across many machines in a cluster, and within a
machine across ... | computer science |
37,046 | Computational Estimate Visualisation and Evaluation of Agent Classified
Rules Learning System | cs.CY | Student modelling and agent classified rules learning as applied in the
development of the intelligent Preassessment System has been presented in
[10],[11]. In this paper, we now demystify the theory behind the development of
the pre-assessment system followed by some computational experimentation and
graph visualisati... | computer science |
37,047 | Psychologically based Virtual-Suspect for Interrogative Interview
Training | cs.AI | In this paper, we present a Virtual-Suspect system which can be used to train
inexperienced law enforcement personnel in interrogation strategies. The system
supports different scenario configurations based on historical data. The
responses presented by the Virtual-Suspect are selected based on the
psychological state ... | computer science |
37,048 | Uncertain programming model for multi-item solid transportation problem | math.OC | In this paper, an uncertain Multi-objective Multi-item Solid Transportation
Problem (MMSTP) based on uncertainty theory is presented. In the model,
transportation costs, supplies, demands and conveyances parameters are taken to
be uncertain parameters. There are restrictions on some items and conveyances
of the model. ... | computer science |
37,049 | Hardness of the Pricing Problem for Chains in Barter Exchanges | cs.DS | Kidney exchange is a barter market where patients trade willing but medically
incompatible donors. These trades occur via cycles, where each patient-donor
pair both gives and receives a kidney, and via chains, which begin with an
altruistic donor who does not require a kidney in return. For logistical
reasons, the maxi... | computer science |
37,050 | How to advance general game playing artificial intelligence by player
modelling | cs.HC | General game playing artificial intelligence has recently seen important
advances due to the various techniques known as 'deep learning'. However the
advances conceal equally important limitations in their reliance on: massive
data sets; fortuitously constructed problems; and absence of any human-level
complexity, incl... | computer science |
37,051 | Mining Software Components from Object-Oriented APIs | cs.SE | Object-oriented Application Programing Interfaces (APIs) support software
reuse by providing pre-implemented functionalities. Due to the huge number of
included classes, reusing and understanding large APIs is a complex task.
Otherwise, software components are admitted to be more reusable and
understandable entities th... | computer science |
37,052 | An interactive fuzzy goal programming algorithm to solve decentralized
bi-level multiobjective fractional programming problem | math.OC | This paper proposes a fuzzy goal programming based on Taylor series for
solving decentralized bi-level multiobjective fractional programming (DBLMOFP)
problem. In the proposed approach, all of the membership functions are
associated with the fuzzy goals of each objective at the both levels and also
the fractional membe... | computer science |
37,053 | Position-Indexed Formulations for Kidney Exchange | cs.DS | A kidney exchange is an organized barter market where patients in need of a
kidney swap willing but incompatible donors. Determining an optimal set of
exchanges is theoretically and empirically hard. Traditionally, exchanges took
place in cycles, with each participating patient-donor pair both giving and
receiving a ki... | computer science |
37,054 | Preliminaries of a Space Situational Awareness Ontology | cs.AI | Space situational awareness (SSA) is vital for international safety and
security, and the future of space travel. By improving SSA data-sharing we
improve global SSA. Computational ontology may provide one means toward that
goal. This paper develops the ontology of the SSA domain and takes steps in the
creation of the ... | computer science |
37,055 | Assisted Energy Management in Smart Microgrids | cs.AI | Demand response provides utilities with a mechanism to share with end users
the stochasticity resulting from the use of renewable sources. Pricing is
accordingly used to reflect energy availability, to allocate such a limited
resource to those loads that value it most. However, the strictly competitive
mechanism can re... | computer science |
37,056 | Multi-resource defensive strategies for patrolling games with alarm
systems | cs.AI | Security Games employ game theoretical tools to derive resource allocation
strategies in security domains. Recent works considered the presence of alarm
systems, even suffering various forms of uncertainty, and showed that
disregarding alarm signals may lead to arbitrarily bad strategies. The central
problem with an al... | computer science |
37,057 | Emotional Intensity analysis in Bipolar subjects | cs.AI | The massive availability of digital repositories of human thought opens
radical novel way of studying the human mind. Natural language processing tools
and computational models have evolved such that many mental conditions are
predicted by analysing speech. Transcription of interviews and discourses are
analyzed using ... | computer science |
37,058 | A Formal Calculus for International Relations Computation and Evaluation | cs.CR | This publication presents a relation computation or calculus for
international relations using a mathematical modeling. It examined trust for
international relations and its calculus, which related to Bayesian inference,
Dempster-Shafer theory and subjective logic. Based on an observation in the
literature, we found no... | computer science |
37,059 | Symbolic Music Data Version 1.0 | cs.SD | In this document, we introduce a new dataset designed for training machine
learning models of symbolic music data. Five datasets are provided, one of
which is from a newly collected corpus of 20K midi files. We describe our
preprocessing and cleaning pipeline, which includes the exclusion of a number
of files based on ... | computer science |
37,060 | Face valuing: Training user interfaces with facial expressions and
reinforcement learning | cs.HC | An important application of interactive machine learning is extending or
amplifying the cognitive and physical capabilities of a human. To accomplish
this, machines need to learn about their human users' intentions and adapt to
their preferences. In most current research, a user has conveyed preferences to
a machine us... | computer science |
37,061 | Arbitrage-Free Combinatorial Market Making via Integer Programming | cs.GT | We present a new combinatorial market maker that operates arbitrage-free
combinatorial prediction markets specified by integer programs. Although the
problem of arbitrage-free pricing, while maintaining a bound on the subsidy
provided by the market maker, is #P-hard in the worst case, we posit that the
typical case mig... | computer science |
37,062 | Understanding User Instructions by Utilizing Open Knowledge for Service
Robots | cs.RO | Understanding user instructions in natural language is an active research
topic in AI and robotics. Typically, natural user instructions are high-level
and can be reduced into low-level tasks expressed in common verbs (e.g.,
`take', `get', `put'). For robots understanding such instructions, one of the
key challenges is... | computer science |
37,063 | Tunable Online MUS/MSS Enumeration | cs.AI | In various areas of computer science, the problem of dealing with a set of
constraints arises. If the set of constraints is unsatisfiable, one may ask for
a minimal description of the reason for this unsatisifi- ability. Minimal
unsatisifable subsets (MUSes) and maximal satisifiable subsets (MSSes) are two
kinds of suc... | computer science |
37,064 | Community Structure in Industrial SAT Instances | cs.AI | Modern SAT solvers have experienced a remarkable progress on solving
industrial instances. Most of the techniques have been developed after an
intensive experimental process. It is believed that these techniques exploit
the underlying structure of industrial instances. However, there are few works
trying to exactly cha... | computer science |
37,065 | Store Location Selection via Mining Search Query Logs of Baidu Maps | cs.AI | Choosing a good location when opening a new store is crucial for the future
success of a business. Traditional methods include offline manual survey, which
is very time consuming, and analytic models based on census data, which are un-
able to adapt to the dynamic market. The rapid increase of the availability of
big d... | computer science |
37,066 | Detecção de comunidades em redes complexas para identificar
gargalos e desperdício de recursos em sistemas de ônibus | cs.AI | We propose here a methodology to help to understand the shortcomings of
public transportation in a city via the mining of complex networks representing
the supply and demand of public transport. We show how to build these networks
based upon data on smart card use in buses via the application of algorithms
that estimat... | computer science |
37,067 | Evidential Label Propagation Algorithm for Graphs | cs.AI | Community detection has attracted considerable attention crossing many areas
as it can be used for discovering the structure and features of complex
networks. With the increasing size of social networks in real world, community
detection approaches should be fast and accurate. The Label Propagation
Algorithm (LPA) is k... | computer science |
37,068 | A framework for redescription set construction | cs.AI | Redescription mining is a field of knowledge discovery that aims at finding
different descriptions of similar subsets of instances in the data. These
descriptions are represented as rules inferred from one or more disjoint sets
of attributes, called views. As such, they support knowledge discovery process
and help doma... | computer science |
37,069 | Networked Intelligence: Towards Autonomous Cyber Physical Systems | cs.AI | Developing intelligent systems requires combining results from both industry
and academia. In this report you find an overview of relevant research fields
and industrially applicable technologies for building very large scale cyber
physical systems. A concept architecture is used to illustrate how existing
pieces may f... | computer science |
37,070 | Using Virtual Humans to Understand Real Ones | cs.HC | Human interactions are characterized by explicit as well as implicit channels
of communication. While the explicit channel transmits overt messages, the
implicit ones transmit hidden messages about the communicator (e.g., his/her
intentions and attitudes). There is a growing consensus that providing a
computer with the... | computer science |
37,071 | Micro-interventions in urban transport from pattern discovery on the
flow of passengers and on the bus network | cs.AI | In this paper, we describe a case study in a big metropolis, in which from
data collected by digital sensors, we tried to understand mobility patterns of
persons using buses and how this can generate knowledge to suggest
interventions that are applied incrementally into the transportation network in
use. We have first ... | computer science |
37,072 | Spreadsheet Probabilistic Programming | cs.AI | Spreadsheet workbook contents are simple programs. Because of this,
probabilistic programming techniques can be used to perform Bayesian inversion
of spreadsheet computations. What is more, existing execution engines in
spreadsheet applications such as Microsoft Excel can be made to do this using
only built-in function... | computer science |
37,073 | Most central or least central? How much modeling decisions influence a
node's centrality ranking in multiplex networks | cs.SI | To understand a node's centrality in a multiplex network, its centrality
values in all the layers of the network can be aggregated. This requires a
normalization of the values, to allow their meaningful comparison and
aggregation over networks with different sizes and orders. The concrete choices
of such preprocessing ... | computer science |
37,074 | The Schema Editor of OpenIoT for Semantic Sensor Networks | cs.AI | Ontologies provide conceptual abstractions over data, in domains such as the
Internet of Things, in a way that sensor data can be harvested and interpreted
by people and applications. The Semantic Sensor Network (SSN) ontology is the
de-facto standard for semantic representation of sensor observations and
metadata, and... | computer science |
37,075 | Étude de Problèmes d'Optimisation Combinatoire à Multiples
Composantes Interdépendantes | cs.AI | This extended abstract presents an overview on NP-hard optimization problems
with multiple interdependent components. These problems occur in many
real-world applications: industrial applications, engineering, and logistics.
The fact that these problems are composed of many sub-problems that are NP-hard
makes them even... | computer science |
37,076 | Structure in the Value Function of Two-Player Zero-Sum Games of
Incomplete Information | cs.AI | Zero-sum stochastic games provide a rich model for competitive decision
making. However, under general forms of state uncertainty as considered in the
Partially Observable Stochastic Game (POSG), such decision making problems are
still not very well understood. This paper makes a contribution to the theory
of zero-sum ... | computer science |
37,077 | Log-based Evaluation of Label Splits for Process Models | cs.DB | Process mining techniques aim to extract insights in processes from event
logs. One of the challenges in process mining is identifying interesting and
meaningful event labels that contribute to a better understanding of the
process. Our application area is mining data from smart homes for elderly,
where the ultimate go... | computer science |
37,078 | Standard State Space Models of Unawareness (Extended Abstract) | cs.AI | The impossibility theorem of Dekel, Lipman and Rustichini has been thought to
demonstrate that standard state-space models cannot be used to represent
unawareness. We first show that Dekel, Lipman and Rustichini do not establish
this claim. We then distinguish three notions of awareness, and argue that
although one of ... | computer science |
37,079 | Ceteris paribus logic in counterfactual reasoning | cs.LO | The semantics for counterfactuals due to David Lewis has been challenged on
the basis of unlikely, or impossible, events. Such events may skew a given
similarity order in favour of those possible worlds which exhibit them. By
updating the relational structure of a model according to a ceteris paribus
clause one forces ... | computer science |
37,080 | Preference at First Sight | cs.LO | We consider decision-making and game scenarios in which an agent is limited
by his/her computational ability to foresee all the available moves towards the
future - that is, we study scenarios with short sight. We focus on how short
sight affects the logical properties of decision making in multi-agent
settings. We sta... | computer science |
37,081 | Parameterized Complexity Results for a Model of Theory of Mind Based on
Dynamic Epistemic Logic | cs.LO | In this paper we introduce a computational-level model of theory of mind
(ToM) based on dynamic epistemic logic (DEL), and we analyze its computational
complexity. The model is a special case of DEL model checking. We provide a
parameterized complexity analysis, considering several aspects of DEL (e.g.,
number of agent... | computer science |
37,082 | Translucent Players: Explaining Cooperative Behavior in Social Dilemmas | cs.GT | In the last few decades, numerous experiments have shown that humans do not
always behave so as to maximize their material payoff. Cooperative behavior
when non-cooperation is a dominant strategy (with respect to the material
payoffs) is particularly puzzling. Here we propose a novel approach to explain
cooperation, as... | computer science |
37,083 | Proactive Decision Support using Automated Planning | cs.HC | Proactive decision support (PDS) helps in improving the decision making
experience of human decision makers in human-in-the-loop planning environments.
Here both the quality of the decisions and the ease of making them are
enhanced. In this regard, we propose a PDS framework, named RADAR, based on the
research in Autom... | computer science |
37,084 | Content-Based Top-N Recommendation using Heterogeneous Relations | cs.IR | Top-$N$ recommender systems have been extensively studied. However, the
sparsity of user-item activities has not been well resolved. While many hybrid
systems were proposed to address the cold-start problem, the profile
information has not been sufficiently leveraged. Furthermore, the heterogeneity
of profiles between ... | computer science |
37,085 | Propagators and Solvers for the Algebra of Modular Systems | cs.AI | To appear in the proceedings of LPAR 21.
Solving complex problems can involve non-trivial combinations of distinct
knowledge bases and problem solvers. The Algebra of Modular Systems is a
knowledge representation framework that provides a method for formally
specifying such systems in purely semantic terms. Formally,... | computer science |
37,086 | Swift: Compiled Inference for Probabilistic Programming Languages | cs.AI | A probabilistic program defines a probability measure over its semantic
structures. One common goal of probabilistic programming languages (PPLs) is to
compute posterior probabilities for arbitrary models and queries, given
observed evidence, using a generic inference engine. Most PPL inference
engines---even the compi... | computer science |
37,087 | Probabilistic Reasoning in the Description Logic ALCP with the Principle
of Maximum Entropy (Full Version) | cs.AI | A central question for knowledge representation is how to encode and handle
uncertain knowledge adequately. We introduce the probabilistic description
logic ALCP that is designed for representing context-dependent knowledge, where
the actual context taking place is uncertain. ALCP allows the expression of
logical depen... | computer science |
37,088 | Encoding Cryptographic Functions to SAT Using Transalg System | cs.AI | In this paper we propose the technology for constructing propositional
encodings of discrete functions. It is aimed at solving inversion problems of
considered functions using state-of-the-art SAT solvers. We implemented this
technology in the form of the software system called Transalg, and used it to
construct SAT en... | computer science |
37,089 | Superintelligence cannot be contained: Lessons from Computability Theory | cs.CY | Superintelligence is a hypothetical agent that possesses intelligence far
surpassing that of the brightest and most gifted human minds. In light of
recent advances in machine intelligence, a number of scientists, philosophers
and technologists have revived the discussion about the potential catastrophic
risks entailed ... | computer science |
37,090 | Lattice Structure of Variable Precision Rough Sets | cs.AI | The main purpose of this paper is to study the lattice structure of variable
precision rough sets. The notion of variation in precision of rough sets have
been further extended to variable precision rough set with variable
classification error and its algebraic properties are also studied. | computer science |
37,091 | Mapping Data to Ontologies with Exceptions Using Answer Set Programming | cs.AI | In ontology-based data access, databases are connected to an ontology via
mappings from queries over the database to queries over the ontology. In this
paper, we consider mappings from relational databases to first-order
ontologies, and define an ASP-based framework for GLAV mappings with queries
over the ontology in t... | computer science |
37,092 | Translating Bayesian Networks into Entity Relationship Models, Extended
Version | cs.DB | Big data analytics applications drive the convergence of data management and
machine learning. But there is no conceptual language available that is spoken
in both worlds. The main contribution of the paper is a method to translate
Bayesian networks, a main conceptual language for probabilistic graphical
models, into u... | computer science |
37,093 | Divisive-agglomerative algorithm and complexity of automatic
classification problems | cs.AI | An algorithm of solution of the Automatic Classification (AC for brevity)
problem is set forth in the paper. In the AC problem, it is required to find
one or several artitions, starting with the given pattern matrix or
dissimilarity, similarity matrix. | computer science |
37,094 | Learning opening books in partially observable games: using random seeds
in Phantom Go | cs.AI | Many artificial intelligences (AIs) are randomized. One can be lucky or
unlucky with the random seed; we quantify this effect and show that, maybe
contrarily to intuition, this is far from being negligible. Then, we apply two
different existing algorithms for selecting good seeds and good probability
distributions over... | computer science |
37,095 | Solving finite-domain linear constraints in presence of the
$\texttt{alldifferent}$ | cs.LO | In this paper, we investigate the possibility of improvement of the
widely-used filtering algorithm for the linear constraints in constraint
satisfaction problems in the presence of the alldifferent constraints. In many
cases, the fact that the variables in a linear constraint are also constrained
by some alldifferent ... | computer science |
37,096 | Extending Weakly-Sticky Datalog+/-: Query-Answering Tractability and
Optimizations | cs.DB | Weakly-sticky (WS) Datalog+/- is an expressive member of the family of
Datalog+/- programs that is based on the syntactic notions of stickiness and
weak-acyclicity. Query answering over the WS programs has been investigated,
but there is still much work to do on the design and implementation of
practical query answerin... | computer science |
37,097 | sk_p: a neural program corrector for MOOCs | cs.PL | We present a novel technique for automatic program correction in MOOCs,
capable of fixing both syntactic and semantic errors without manual, problem
specific correction strategies. Given an incorrect student program, it
generates candidate programs from a distribution of likely corrections, and
checks each candidate fo... | computer science |
37,098 | A Framework for Estimating Long Term Driver Behavior | cs.RO | The authors present a cyber-physical systems study on the estimation of
driver behavior in autonomous vehicles and vehicle safety systems. Extending
upon previous work, the approach described is suitable for the long term
estimation and tracking of autonomous vehicle behavior. The proposed system
makes use of a previou... | computer science |
37,099 | Vista: A Visually, Socially, and Temporally-aware Model for Artistic
Recommendation | cs.IR | Understanding users' interactions with highly subjective content---like
artistic images---is challenging due to the complex semantics that guide our
preferences. On the one hand one has to overcome `standard' recommender systems
challenges, such as dealing with large, sparse, and long-tailed datasets. On
the other, sev... | computer science |
37,100 | Intrinsically Motivated Multimodal Structure Learning | cs.RO | We present a long-term intrinsically motivated structure learning method for
modeling transition dynamics during controlled interactions between a robot and
semi-permanent structures in the world. In particular, we discuss how
partially-observable state is represented using distributions over a Markovian
state and buil... | computer science |
37,101 | Global Continuous Optimization with Error Bound and Fast Convergence | math.OC | This paper considers global optimization with a black-box unknown objective
function that can be non-convex and non-differentiable. Such a difficult
optimization problem arises in many real-world applications, such as parameter
tuning in machine learning, engineering design problem, and planning with a
complex physics ... | computer science |
37,102 | Towards Analytics Aware Ontology Based Access to Static and Streaming
Data (Extended Version) | cs.AI | Real-time analytics that requires integration and aggregation of
heterogeneous and distributed streaming and static data is a typical task in
many industrial scenarios such as diagnostics of turbines in Siemens. OBDA
approach has a great potential to facilitate such tasks; however, it has a
number of limitations in dea... | computer science |
37,103 | Exploiting Vagueness for Multi-Agent Consensus | cs.MA | A framework for consensus modelling is introduced using Kleene's three valued
logic as a means to express vagueness in agents' beliefs. Explicitly borderline
cases are inherent to propositions involving vague concepts where sentences of
a propositional language may be absolutely true, absolutely false or
borderline. By... | computer science |
37,104 | An Event Grouping Based Algorithm for University Course Timetabling
Problem | cs.AI | This paper presents the study of an event grouping based algorithm for a
university course timetabling problem. Several publications which discuss the
problem and some approaches for its solution are analyzed. The grouping of
events in groups with an equal number of events in each group is not applicable
to all input d... | computer science |
37,105 | Indebted households profiling: a knowledge discovery from database
approach | cs.AI | A major challenge in consumer credit risk portfolio management is to classify
households according to their risk profile. In order to build such risk
profiles it is necessary to employ an approach that analyses data
systematically in order to detect important relationships, interactions,
dependencies and associations a... | computer science |
37,106 | Juxtaposition of System Dynamics and Agent-based Simulation for a Case
Study in Immunosenescence | cs.AI | Advances in healthcare and in the quality of life significantly increase
human life expectancy. With the ageing of populations, new un-faced challenges
are brought to science. The human body is naturally selected to be
well-functioning until the age of reproduction to keep the species alive.
However, as the lifespan ex... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.