Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,707 | Top-k Query Answering in Datalog+/- Ontologies under Subjective Reports
(Technical Report) | cs.AI | The use of preferences in query answering, both in traditional databases and
in ontology-based data access, has recently received much attention, due to its
many real-world applications. In this paper, we tackle the problem of top-k
query answering in Datalog+/- ontologies subject to the querying user's
preferences and... | computer science |
36,708 | Characterizing and Extending Answer Set Semantics using Possibility
Theory | cs.AI | Answer Set Programming (ASP) is a popular framework for modeling
combinatorial problems. However, ASP cannot easily be used for reasoning about
uncertain information. Possibilistic ASP (PASP) is an extension of ASP that
combines possibilistic logic and ASP. In PASP a weight is associated with each
rule, where this weig... | computer science |
36,709 | A semi-automatic semantic method for mapping SNOMED CT concepts to VCM
Icons | cs.AI | VCM (Visualization of Concept in Medicine) is an iconic language for
representing key medical concepts by icons. However, the use of this language
with reference terminologies, such as SNOMED CT, will require the mapping of
its icons to the terms of these terminologies. Here, we present and evaluate a
semi-automatic se... | computer science |
36,710 | High Throughput Virtual Screening with Data Level Parallelism in
Multi-core Processors | cs.AI | Improving the throughput of molecular docking, a computationally intensive
phase of the virtual screening process, is a highly sought area of research
since it has a significant weight in the drug designing process. With such
improvements, the world might find cures for incurable diseases like HIV
disease and Cancer so... | computer science |
36,711 | A Novel Hierarchical Ant based QoS aware Intelligent Routing Scheme for
MANETS | cs.NI | MANET is a collection of mobile devices with no centralized control and no
pre-existing infrastructures. Due to the nodal mobility, supporting QoS during
routing in this type of networks is a very challenging task. To tackle this
type of overhead many routing algorithms with clustering approach have been
proposed. Clus... | computer science |
36,712 | A state vector algebra for algorithmic implementation of second-order
logic | cs.AI | We present a mathematical framework for mapping second-order logic relations
onto a simple state vector algebra. Using this algebra, basic theorems of set
theory can be proven in an algorithmic way, hence by an expert system. We
illustrate the use of the algebra with simple examples and show that, in
principle, all the... | computer science |
36,713 | Representing Knowledge Base into Database for WAP and Web-based Expert
System | cs.AI | Expert System is developed as consulting service for users spread or public
requires affordable access. The Internet has become a medium for such services,
but presence of mobile devices make the access becomes more widespread by
utilizing mobile web and WAP (Wireless Application Protocol). Applying expert
systems appl... | computer science |
36,714 | A Review of Temporal Aspects of Hand Gesture Analysis Applied to
Discourse Analysis and Natural Conversation | cs.HC | Lately, there has been an increasing interest in hand gesture analysis
systems. Recent works have employed pattern recognition techniques and have
focused on the development of systems with more natural user interfaces. These
systems may use gestures to control interfaces or recognize sign language
gestures, which can ... | computer science |
36,715 | RDF Translator: A RESTful Multi-Format Data Converter for the Semantic
Web | cs.DL | The interdisciplinary nature of the Semantic Web and the many projects put
forward by the community led to a large number of widely accepted serialization
formats for RDF. Most of these RDF syntaxes have been developed out of a
necessity to serve specific purposes better than existing ones, e.g. RDFa was
proposed as an... | computer science |
36,716 | Representing, Simulating and Analysing Ho Chi Minh City Tsunami Plan by
Means of Process Models | cs.CY | This paper considers the textual plan (guidelines) proposed by People's
Committee of Ho Chi Minh City (Vietnam) to manage earthquake and tsunami, and
try to represent it in a more formal way, in order to provide means to
simulate, analyse and adapt it. We first present a state of the art about
coordination models for d... | computer science |
36,717 | On the Semantics of Gringo | cs.AI | Input languages of answer set solvers are based on the mathematically simple
concept of a stable model. But many useful constructs available in these
languages, including local variables, conditional literals, and aggregates,
cannot be easily explained in terms of stable models in the sense of the
original definition o... | computer science |
36,718 | Fair assignment of indivisible objects under ordinal preferences | cs.GT | We consider the discrete assignment problem in which agents express ordinal
preferences over objects and these objects are allocated to the agents in a
fair manner. We use the stochastic dominance relation between fractional or
randomized allocations to systematically define varying notions of
proportionality and envy-... | computer science |
36,719 | The Value Iteration Algorithm is Not Strongly Polynomial for Discounted
Dynamic Programming | cs.AI | This note provides a simple example demonstrating that, if exact computations
are allowed, the number of iterations required for the value iteration
algorithm to find an optimal policy for discounted dynamic programming problems
may grow arbitrarily quickly with the size of the problem. In particular, the
number of ite... | computer science |
36,720 | Modeling contaminant intrusion in water distribution networks based on D
numbers | cs.AI | Efficient modeling on uncertain information plays an important role in
estimating the risk of contaminant intrusion in water distribution networks.
Dempster-Shafer evidence theory is one of the most commonly used methods.
However, the Dempster-Shafer evidence theory has some hypotheses including the
exclusive property ... | computer science |
36,721 | Reasoning about Knowledge and Strategies: Epistemic Strategy Logic | cs.LO | In this paper we introduce Epistemic Strategy Logic (ESL), an extension of
Strategy Logic with modal operators for individual knowledge. This enhanced
framework allows us to represent explicitly and to reason about the knowledge
agents have of their own and other agents' strategies. We provide a semantics
to ESL in ter... | computer science |
36,722 | A Resolution Prover for Coalition Logic | cs.LO | We present a prototype tool for automated reasoning for Coalition Logic, a
non-normal modal logic that can be used for reasoning about cooperative agency.
The theorem prover CLProver is based on recent work on a resolution-based
calculus for Coalition Logic that operates on coalition problems, a normal form
for Coaliti... | computer science |
36,723 | Enabling Automatic Certification of Online Auctions | cs.LO | We consider the problem of building up trust in a network of online auctions
by software agents. This requires agents to have a deeper understanding of
auction mechanisms and be able to verify desirable properties of a given
mechanism. We have shown how these mechanisms can be formalised as semantic web
services in OWL... | computer science |
36,724 | On a correlational clustering of integers | math.NT | Correlation clustering is a concept of machine learning. The ultimate goal of
such a clustering is to find a partition with minimal conflicts. In this paper
we investigate a correlation clustering of integers, based upon the greatest
common divisor. | computer science |
36,725 | Implementing Anti-Unification Modulo Equational Theory | cs.LO | We present an implementation of E-anti-unification as defined in Heinz
(1995), where tree-grammar descriptions of equivalence classes of terms are
used to compute generalizations modulo equational theories. We discuss several
improvements, including an efficient implementation of variable-restricted
E-anti-unification ... | computer science |
36,726 | Thou Shalt is not You Will | cs.AI | In this paper we discuss some reasons why temporal logic might not be
suitable to model real life norms. To show this, we present a novel deontic
logic contrary-to-duty/derived permission paradox based on the interaction of
obligations, permissions and contrary-to-duty obligations. The paradox is
inspired by real life ... | computer science |
36,727 | Outer-Product Hidden Markov Model and Polyphonic MIDI Score Following | cs.AI | We present a polyphonic MIDI score-following algorithm capable of following
performances with arbitrary repeats and skips, based on a probabilistic model
of musical performances. It is attractive in practical applications of score
following to handle repeats and skips which may be made arbitrarily during
performances, ... | computer science |
36,728 | A Stochastic Temporal Model of Polyphonic MIDI Performance with
Ornaments | cs.AI | We study indeterminacies in realization of ornaments and how they can be
incorporated in a stochastic performance model applicable for music information
processing such as score-performance matching. We point out the importance of
temporal information, and propose a hidden Markov model which describes it
explicitly and... | computer science |
36,729 | Distribution-Aware Sampling and Weighted Model Counting for SAT | cs.AI | Given a CNF formula and a weight for each assignment of values to variables,
two natural problems are weighted model counting and distribution-aware
sampling of satisfying assignments. Both problems have a wide variety of
important applications. Due to the inherent complexity of the exact versions of
the problems, inte... | computer science |
36,730 | Datalog Rewritability of Disjunctive Datalog Programs and its
Applications to Ontology Reasoning | cs.AI | We study the problem of rewriting a disjunctive datalog program into plain
datalog. We show that a disjunctive program is rewritable if and only if it is
equivalent to a linear disjunctive program, thus providing a novel
characterisation of datalog rewritability. Motivated by this result, we propose
weakly linear disju... | computer science |
36,731 | On Backdoors To Tractable Constraint Languages | cs.AI | In the context of CSPs, a strong backdoor is a subset of variables such that
every complete assignment yields a residual instance guaranteed to have a
specified property. If the property allows efficient solving, then a small
strong backdoor provides a reasonable decomposition of the original instance
into easy instanc... | computer science |
36,732 | Managing Change in Graph-structured Data Using Description Logics (long
version with appendix) | cs.AI | In this paper, we consider the setting of graph-structured data that evolves
as a result of operations carried out by users or applications. We study
different reasoning problems, which range from ensuring the satisfaction of a
given set of integrity constraints after a given sequence of updates, to
deciding the (non-)... | computer science |
36,733 | Automated Classification of Airborne Laser Scanning Point Clouds | cs.CE | Making sense of the physical world has always been at the core of mapping. Up
until recently, this has always dependent on using the human eye. Using
airborne lasers, it has become possible to quickly "see" more of the world in
many more dimensions. The resulting enormous point clouds serve as data sources
for applicat... | computer science |
36,734 | A Complete Solver for Constraint Games | cs.GT | Game Theory studies situations in which multiple agents having conflicting
objectives have to reach a collective decision. The question of a compact
representation language for agents utility function is of crucial importance
since the classical representation of a $n$-players game is given by a
$n$-dimensional matrix ... | computer science |
36,735 | Hybrid Genetic Algorithm for Cloud Computing Applications | cs.DC | In this paper with the aid of genetic algorithm and fuzzy theory, we present
a hybrid job scheduling approach, which considers the load balancing of the
system and reduces total execution time and execution cost. We try to modify
the standard Genetic algorithm and to reduce the iteration of creating
population with the... | computer science |
36,736 | A Formal Analysis of Required Cooperation in Multi-agent Planning | cs.AI | Research on multi-agent planning has been popular in recent years. While
previous research has been motivated by the understanding that, through
cooperation, multi-agent systems can achieve tasks that are unachievable by
single-agent systems, there are no formal characterizations of situations where
cooperation is requ... | computer science |
36,737 | Modeling multi-stage decision optimization problems | math.OC | Multi-stage optimization under uncertainty techniques can be used to solve
long-term management problems. Although many optimization modeling language
extensions as well as computational environments have been proposed, the
acceptance of this technique is generally low, due to the inherent complexity
of the modeling an... | computer science |
36,738 | Gradual Classical Logic for Attributed Objects | cs.AI | There is knowledge. There is belief. And there is tacit agreement.' 'We may
talk about objects. We may talk about attributes of the objects. Or we may talk
both about objects and their attributes.' This work inspects tacit agreements
on assumptions about the relation between objects and their attributes, and
studies a ... | computer science |
36,739 | Belief merging within fragments of propositional logic | cs.AI | Recently, belief change within the framework of fragments of propositional
logic has gained increasing attention. Previous works focused on belief
contraction and belief revision on the Horn fragment. However, the problem of
belief merging within fragments of propositional logic has been neglected so
far. This paper pr... | computer science |
36,740 | Une approche CSP pour l'aide à la localisation d'erreurs | cs.AI | We introduce in this paper a new CP-based approach to support errors location
in a program for which a counter-example is available, i.e. an instantiation of
the input variables that violates the post-condition. To provide helpful
information for error location, we generate a constraint system for the paths
of the CFG ... | computer science |
36,741 | Generalizing Modular Logic Programs | cs.AI | Even though modularity has been studied extensively in conventional logic
programming, there are few approaches on how to incorporate modularity into
Answer Set Programming, a prominent rule-based declarative programming
paradigm. A major approach is Oikarinnen and Janhunen's Gaifman-Shapiro-style
architecture of progr... | computer science |
36,742 | An Approach to Forgetting in Disjunctive Logic Programs that Preserves
Strong Equivalence | cs.AI | In this paper we investigate forgetting in disjunctive logic programs, where
forgetting an atom from a program amounts to a reduction in the signature of
that program. The goal is to provide an approach that is syntax-independent, in
that if two programs are strongly equivalent, then the results of forgetting an
atom i... | computer science |
36,743 | Decision-theoretic approaches to non-knowledge in economics | cs.AI | We review two strands of conceptual approaches to the formal representation
of a decision maker's non-knowledge at the initial stage of a static
one-person, one-shot decision problem in economic theory. One focuses on
representations of non-knowledge in terms of probability measures over sets of
mutually exclusive and ... | computer science |
36,744 | Fuzzy Model on Human Emotions Recognition | cs.AI | This paper discusses a fuzzy model for multi-level human emotions recognition
by computer systems through keyboard keystrokes, mouse and touchscreen
interactions. This model can also be used to detect the other possible emotions
at the time of recognition. Accuracy measurements of human emotions by the
fuzzy model are ... | computer science |
36,745 | A Coordinated MDP Approach to Multi-Agent Planning for Resource
Allocation, with Applications to Healthcare | cs.AI | This paper considers a novel approach to scalable multiagent resource
allocation in dynamic settings. We propose an approximate solution in which
each resource consumer is represented by an independent MDP-based agent that
models expected utility using an average model of its expected access to
resources given only lim... | computer science |
36,746 | A New Rational Algorithm for View Updating in Relational Databases | cs.AI | The dynamics of belief and knowledge is one of the major components of any
autonomous system that should be able to incorporate new pieces of information.
In order to apply the rationality result of belief dynamics theory to various
practical problems, it should be generalized in two respects: first it should
allow a c... | computer science |
36,747 | Abduction and Dialogical Proof in Argumentation and Logic Programming | cs.AI | We develop a model of abduction in abstract argumentation, where changes to
an argumentation framework act as hypotheses to explain the support of an
observation. We present dialogical proof theories for the main decision
problems (i.e., finding hypothe- ses that explain skeptical/credulous support)
and we show that ou... | computer science |
36,748 | Strategy Synthesis for General Deductive Games Based on SAT Solving | cs.AI | We propose a general framework for modelling and solving deductive games,
where one player selects a secret code and the other player strives to discover
this code using a minimal number of allowed experiments that reveal some
partial information about the code. The framework is implemented in a software
tool Cobra, an... | computer science |
36,749 | Data Assimilation by Artificial Neural Networks for an Atmospheric
General Circulation Model: Conventional Observation | cs.AI | This paper presents an approach for employing artificial neural networks (NN)
to emulate an ensemble Kalman filter (EnKF) as a method of data assimilation.
The assimilation methods are tested in the Simplified Parameterizations
PrimitivE-Equation Dynamics (SPEEDY) model, an atmospheric general circulation
model (AGCM),... | computer science |
36,750 | Virus Detection in Multiplexed Nanowire Arrays using Hidden Semi-Markov
models | cs.AI | In this paper, we address the problem of real-time detection of viruses
docking to nanowires, especially when multiple viruses dock to the same
nano-wire. The task becomes more complicated when there is an array of
nanowires coated with different antibodies, where different viruses can dock to
each coated nanowire at d... | computer science |
36,751 | Consistent transformations of belief functions | cs.AI | Consistent belief functions represent collections of coherent or
non-contradictory pieces of evidence, but most of all they are the counterparts
of consistent knowledge bases in belief calculus. The use of consistent
transformations cs[.] in a reasoning process to guarantee coherence can
therefore be desirable, and gen... | computer science |
36,752 | Market Making with Decreasing Utility for Information | cs.GT | We study information elicitation in cost-function-based combinatorial
prediction markets when the market maker's utility for information decreases
over time. In the sudden revelation setting, it is known that some piece of
information will be revealed to traders, and the market maker wishes to prevent
guaranteed profit... | computer science |
36,753 | MONEYBaRL: Exploiting pitcher decision-making using Reinforcement
Learning | cs.AI | This manuscript uses machine learning techniques to exploit baseball
pitchers' decision making, so-called "Baseball IQ," by modeling the at-bat
information, pitch selection and counts, as a Markov Decision Process (MDP).
Each state of the MDP models the pitcher's current pitch selection in a
Markovian fashion, conditio... | computer science |
36,754 | Team Behavior in Interactive Dynamic Influence Diagrams with
Applications to Ad Hoc Teams | cs.MA | Planning for ad hoc teamwork is challenging because it involves agents
collaborating without any prior coordination or communication. The focus is on
principled methods for a single agent to cooperate with others. This motivates
investigating the ad hoc teamwork problem in the context of individual decision
making fram... | computer science |
36,755 | Friendly Artificial Intelligence: the Physics Challenge | cs.CY | Relentless progress in artificial intelligence (AI) is increasingly raising
concerns that machines will replace humans on the job market, and perhaps
altogether. Eliezer Yudkowski and others have explored the possibility that a
promising future for humankind could be guaranteed by a superintelligent
"Friendly AI", desi... | computer science |
36,756 | Deontic modality based on preference | cs.LO | Deontic modalities are here defined in terms of the preference relation
explored in our previous work (Osherson and Weinstein, 2012). Some consequences
of the system are discussed. | computer science |
36,757 | Unsynthesizable Cores - Minimal Explanations for Unsynthesizable
High-Level Robot Behaviors | cs.RO | With the increasing ubiquity of multi-capable, general-purpose robots arises
the need for enabling non-expert users to command these robots to perform
complex high-level tasks. To this end, high-level robot control has seen the
application of formal methods to automatically synthesize
correct-by-construction controller... | computer science |
36,758 | Co-adaptation in a Handwriting Recognition System | cs.HC | Handwriting is a natural and versatile method for human-computer interaction,
especially on small mobile devices such as smart phones. However, as
handwriting varies significantly from person to person, it is difficult to
design handwriting recognizers that perform well for all users. A natural
solution is to use machi... | computer science |
36,759 | Probabilistic Selection in AgentSpeak(L) | cs.MA | Agent programming is mostly a symbolic discipline and, as such, draws little
benefits from probabilistic areas as machine learning and graphical models.
However, the greatest objective of agent research is the achievement of
autonomy in dynamical and complex environments --- a goal that implies
embracing uncertainty an... | computer science |
36,760 | Crowdsourcing Pareto-Optimal Object Finding by Pairwise Comparisons | cs.AI | This is the first study on crowdsourcing Pareto-optimal object finding, which
has applications in public opinion collection, group decision making, and
information exploration. Departing from prior studies on crowdsourcing skyline
and ranking queries, it considers the case where objects do not have explicit
attributes ... | computer science |
36,761 | ICE: Enabling Non-Experts to Build Models Interactively for Large-Scale
Lopsided Problems | cs.AI | Quick interaction between a human teacher and a learning machine presents
numerous benefits and challenges when working with web-scale data. The human
teacher guides the machine towards accomplishing the task of interest. The
learning machine leverages big data to find examples that maximize the training
value of its i... | computer science |
36,762 | A Tabu Search Algorithm for the Multi-period Inspector Scheduling
Problem | cs.AI | This paper introduces a multi-period inspector scheduling problem (MPISP),
which is a new variant of the multi-trip vehicle routing problem with time
windows (VRPTW). In the MPISP, each inspector is scheduled to perform a route
in a given multi-period planning horizon. At the end of each period, each
inspector is not r... | computer science |
36,763 | Solving Graph Coloring Problems with Abstraction and Symmetry | cs.AI | This paper introduces a general methodology, based on abstraction and
symmetry, that applies to solve hard graph edge-coloring problems and
demonstrates its use to provide further evidence that the Ramsey number
$R(4,3,3)=30$. The number $R(4,3,3)$ is often presented as the unknown Ramsey
number with the best chances o... | computer science |
36,764 | Oblivious Bounds on the Probability of Boolean Functions | cs.AI | This paper develops upper and lower bounds for the probability of Boolean
functions by treating multiple occurrences of variables as independent and
assigning them new individual probabilities. We call this approach dissociation
and give an exact characterization of optimal oblivious bounds, i.e. when the
new probabili... | computer science |
36,765 | Neighborhood Selection and Rules Identification for Cellular Automata: A
Rough Sets Approach | cs.AI | In this paper a method is proposed which uses data mining techniques based on
rough sets theory to select neighborhood and determine update rule for cellular
automata (CA). According to the proposed approach, neighborhood is detected by
reducts calculations and a rule-learning algorithm is applied to induce a set
of de... | computer science |
36,766 | The Application of Differential Privacy for Rank Aggregation: Privacy
and Accuracy | cs.AI | The potential risk of privacy leakage prevents users from sharing their
honest opinions on social platforms. This paper addresses the problem of
privacy preservation if the query returns the histogram of rankings. The
framework of differential privacy is applied to rank aggregation. The error
probability of the aggrega... | computer science |
36,767 | Causal Graph Justifications of Logic Programs | cs.AI | In this work we propose a multi-valued extension of logic programs under the
stable models semantics where each true atom in a model is associated with a
set of justifications. These justifications are expressed in terms of causal
graphs formed by rule labels and edges that represent their application
ordering. For pos... | computer science |
36,768 | PinView: Implicit Feedback in Content-Based Image Retrieval | cs.IR | This paper describes PinView, a content-based image retrieval system that
exploits implicit relevance feedback collected during a search session. PinView
contains several novel methods to infer the intent of the user. From relevance
feedback, such as eye movements or pointer clicks, and visual features of
images, PinVi... | computer science |
36,769 | Presence-absence reasoning for evolutionary phenotypes | cs.AI | Nearly invariably, phenotypes are reported in the scientific literature in
meticulous detail, utilizing the full expressivity of natural language. Often
it is particularly these detailed observations (facts) that are of interest,
and thus specific to the research questions that motivated observing and
reporting them. H... | computer science |
36,770 | Certified Connection Tableaux Proofs for HOL Light and TPTP | cs.LO | In the recent years, the Metis prover based on ordered paramodulation and
model elimination has replaced the earlier built-in methods for general-purpose
proof automation in HOL4 and Isabelle/HOL. In the annual CASC competition, the
leanCoP system based on connection tableaux has however performed better than
Metis. In... | computer science |
36,771 | The Tomaco Hybrid Matching Framework for SAWSDL Semantic Web Services | cs.SE | This work aims to resolve issues related to Web Service retrieval, also known
as Service Selection, Discovery or essentially Matching, in two directions.
Firstly, a novel matching algorithm for SAWSDL is introduced. The algorithm is
hybrid in nature, combining novel and known concepts, such as a logic-based
strategy an... | computer science |
36,772 | Log-Optimal Portfolio Selection Using the Blackwell Approachability
Theorem | cs.AI | We present a method for constructing the log-optimal portfolio using the
well-calibrated forecasts of market values. Dawid's notion of calibration and
the Blackwell approachability theorem are used for computing well-calibrated
forecasts. We select a portfolio using this "artificial" probability
distribution of market ... | computer science |
36,773 | The Quantum Nature of Identity in Human Thought: Bose-Einstein
Statistics for Conceptual Indistinguishability | cs.AI | Increasing experimental evidence shows that humans combine concepts in a way
that violates the rules of classical logic and probability theory. On the other
hand, mathematical models inspired by the formalism of quantum theory are in
accordance with data on concepts and their combinations. In this paper, we
investigate... | computer science |
36,774 | Efficient optimisation of structures using tabu search | cs.CE | This paper presents a novel approach to the optimisation of structures using
a Tabu search (TS) method. TS is a metaheuristic which is used to guide local
search methods towards a globally optimal solution by using flexible memory
cycles of differing time spans. Results are presented for the well established
ten bar tr... | computer science |
36,775 | A Statistical Decision-Theoretic Framework for Social Choice | cs.AI | In this paper, we take a statistical decision-theoretic viewpoint on social
choice, putting a focus on the decision to be made on behalf of a system of
agents. In our framework, we are given a statistical ranking model, a decision
space, and a loss function defined on (parameter, decision) pairs, and
formulate social c... | computer science |
36,776 | Tasks that Require, or can Benefit from, Matching Blank Nodes | cs.AI | In various domains and cases, we observe the creation and usage of
information elements which are unnamed. Such elements do not have a name, or
may have a name that is not externally referable (usually meaningless and not
persistent over time). This paper discusses why we will never `escape' from the
problem of having ... | computer science |
36,777 | How Many Workers to Ask? Adaptive Exploration for Collecting High
Quality Labels | cs.AI | Crowdsourcing has been part of the IR toolbox as a cheap and fast mechanism
to obtain labels for system development and evaluation. Successful deployment
of crowdsourcing at scale involves adjusting many variables, a very important
one being the number of workers needed per human intelligence task (HIT). We
consider th... | computer science |
36,778 | On the read-once property of branching programs and CNFs of bounded
treewidth | cs.CC | In this paper we prove a space lower bound of $n^{\Omega(k)}$ for
non-deterministic (syntactic) read-once branching programs ({\sc nrobp}s) on
functions expressible as {\sc cnf}s with treewidth at most $k$ of their primal
graphs. This lower bound rules out the possibility of fixed-parameter space
complexity of {\sc nro... | computer science |
36,779 | Approximate Counting in SMT and Value Estimation for Probabilistic
Programs | cs.LO | #SMT, or model counting for logical theories, is a well-known hard problem
that generalizes such tasks as counting the number of satisfying assignments to
a Boolean formula and computing the volume of a polytope. In the realm of
satisfiability modulo theories (SMT) there is a growing need for model counting
solvers, co... | computer science |
36,780 | A Multi-Heuristic Approach for Solving the Pre-Marshalling Problem | cs.AI | Minimizing the number of reshuffling operations at maritime container
terminals incorporates the Pre-Marshalling Problem (PMP) as an important
problem. Based on an analysis of existing solution approaches we develop new
heuristics utilizing specific properties of problem instances of the PMP. We
show that the heuristic... | computer science |
36,781 | Learning of Agent Capability Models with Applications in Multi-agent
Planning | cs.AI | One important challenge for a set of agents to achieve more efficient
collaboration is for these agents to maintain proper models of each other. An
important aspect of these models of other agents is that they are often partial
and incomplete. Thus far, there are two common representations of agent models:
MDP based an... | computer science |
36,782 | Scalable Parallel Numerical CSP Solver | cs.AI | We present a parallel solver for numerical constraint satisfaction problems
(NCSPs) that can scale on a number of cores. Our proposed method runs worker
solvers on the available cores and simultaneously the workers cooperate for the
search space distribution and balancing. In the experiments, we attained up to
119-fold... | computer science |
36,783 | Hardware and Software manual for Evolution of Oil Droplets in a
Chemo-Robotic Platform | cs.RO | This manual outlines a fully automated liquid handling robot to enable
physically-embodied evolution within a chemical oil-droplet system. The robot
is based upon the REPRAP3D printer system and makes the droplets by mixing
chemicals and then placing them in a petri dish after which they are recorded
using a camera and... | computer science |
36,784 | Estimating Fire Weather Indices via Semantic Reasoning over Wireless
Sensor Network Data Streams | cs.CY | Wildfires are frequent, devastating events in Australia that regularly cause
significant loss of life and widespread property damage. Fire weather indices
are a widely-adopted method for measuring fire danger and they play a
significant role in issuing bushfire warnings and in anticipating demand for
bushfire managemen... | computer science |
36,785 | Exploiting Parallelism for Hard Problems in Abstract Argumentation:
Technical Report | cs.AI | Abstract argumentation framework (\AFname) is a unifying framework able to
encompass a variety of nonmonotonic reasoning approaches, logic programming and
computational argumentation. Yet, efficient approaches for most of the decision
and enumeration problems associated to \AFname s are missing, thus potentially
limiti... | computer science |
36,786 | Logical Limitations to Machine Ethics with Consequences to Lethal
Autonomous Weapons | cs.CY | Lethal Autonomous Weapons promise to revolutionize warfare -- and raise a
multitude of ethical and legal questions. It has thus been suggested to program
values and principles of conduct (such as the Geneva Conventions) into the
machines' control, thereby rendering them both physically and morally superior
to human com... | computer science |
36,787 | On Sparse Discretization for Graphical Games | cs.AI | This short paper concerns discretization schemes for representing and
computing approximate Nash equilibria, with emphasis on graphical games, but
briefly touching on normal-form and poly-matrix games. The main technical
contribution is a representation theorem that informally states that to account
for every exact Nas... | computer science |
36,788 | A Unified View of Large-scale Zero-sum Equilibrium Computation | cs.AI | The task of computing approximate Nash equilibria in large zero-sum
extensive-form games has received a tremendous amount of attention due mainly
to the Annual Computer Poker Competition. Immediately after its inception, two
competing and seemingly different approaches emerged---one an application of
no-regret online l... | computer science |
36,789 | Can we build a conscious machine? | cs.ET | The underlying physiological mechanisms of generating conscious states are
still unknown. To make progress on the problem of consciousness, we will need
to experimentally design a system that evolves in a similar way our brains do.
Recent experimental data show that the multiscale nature of the evolving human
brain can... | computer science |
36,790 | Ontology Module Extraction via Datalog Reasoning | cs.AI | Module extraction - the task of computing a (preferably small) fragment M of
an ontology T that preserves entailments over a signature S - has found many
applications in recent years. Extracting modules of minimal size is, however,
computationally hard, and often algorithmically infeasible. Thus, practical
techniques a... | computer science |
36,791 | HCRS: A hybrid clothes recommender system based on user ratings and
product features | cs.AI | Nowadays, online clothes-selling business has become popular and extremely
attractive because of its convenience and cheap-and-fine price. Good examples
of these successful Web sites include Yintai.com, Vancl.com and
Shop.vipshop.com which provide thousands of clothes for online shoppers. The
challenge for online shopp... | computer science |
36,792 | Some Reflections on the Set-based and the Conditional-based
Interpretations of Statements in Syllogistic Reasoning | cs.AI | Two interpretations about syllogistic statements are described in this paper.
One is the so-called set-based interpretation, which assumes that quantified
statements and syllogisms talk about quantity-relationships between sets. The
other one, the so-called conditional interpretation, assumes that quantified
propositio... | computer science |
36,793 | Canonical Logic Programs are Succinctly Incomparable with Propositional
Formulas | cs.LO | \emph{Canonical (logic) programs} (CP) refer to normal logic programs
augmented with connective $not\ not$. In this paper we address the question of
whether CP are \emph{succinctly incomparable} with \emph{propositional
formulas} (PF). Our main result shows that the PARITY problem, which can be
polynomially represented... | computer science |
36,794 | RoboBrain: Large-Scale Knowledge Engine for Robots | cs.AI | In this paper we introduce a knowledge engine, which learns and shares
knowledge representations, for robots to carry out a variety of tasks. Building
such an engine brings with it the challenge of dealing with multiple data
modalities including symbols, natural language, haptic senses, robot
trajectories, visual featu... | computer science |
36,795 | Expressiveness of Logic Programs under General Stable Model Semantics | cs.AI | The stable model semantics had been recently generalized to non-Herbrand
structures by several works, which provides a unified framework and solid
logical foundations for answer set programming. This paper focuses on the
expressiveness of normal and disjunctive programs under the general stable
model semantics. A trans... | computer science |
36,796 | A CSP implementation of the bigraph embedding problem | cs.LO | A crucial problem for many results and tools about bigraphs and bigraphical
reactive systems is bigraph embedding. An embedding is more informative than a
bigraph matching, since it keeps track of the correspondence between the
various components of the redex (guest) within the agent (host). In this paper,
we present a... | computer science |
36,797 | Approximate Lifted Inference with Probabilistic Databases | cs.DB | This paper proposes a new approach for approximate evaluation of #P-hard
queries with probabilistic databases. In our approach, every query is evaluated
entirely in the database engine by evaluating a fixed number of query plans,
each providing an upper bound on the true probability, then taking their
minimum. We provi... | computer science |
36,798 | Knowledge, Justification, and Reason-Based Belief | cs.LO | Is knowledge definable as justified true belief ("JTB")? We argue that one
can legitimately answer positively or negatively, depending on how the notion
of justification is understood. To facilitate our argument, we introduce a
simple propositional logic of reason-based belief. We show that this logic is
sufficiently f... | computer science |
36,799 | Possible and Necessary Allocations via Sequential Mechanisms | cs.AI | A simple mechanism for allocating indivisible resources is sequential
allocation in which agents take turns to pick items. We focus on possible and
necessary allocation problems, checking whether allocations of a given form
occur in some or all mechanisms for several commonly used classes of sequential
allocation mecha... | computer science |
36,800 | On the Behavioural Formalization of the Cognitive Middleware AWDRAT | cs.AI | We present our ongoing work and initial results towards the (behavioral)
correctness analysis of the cognitive middleware AWDRAT. Since, the (provable)
behavioral correctness of a software system is a fundamental pre-requisite of
the system's security. Therefore, the goal of the work is to first formalize
the behaviora... | computer science |
36,801 | Plan or not: Remote Human-robot Teaming with Incomplete Task Information | cs.AI | Human-robot interaction can be divided into two categories based on the
physical distance between the human and robot: remote and proximal. In proximal
interaction, the human and robot often engage in close coordination; in remote
interaction, the human and robot are less coupled due to communication
constraints. As a ... | computer science |
36,802 | Computoser - rule-based, probability-driven algorithmic music
composition | cs.AI | This paper presents the Computoser hybrid probability/rule based algorithm
for music composition (http://computoser.com) and provides a reference
implementation. It addresses the issues of unpleasantness and lack of variation
exhibited by many existing approaches by combining the two methods (basing the
parameters of t... | computer science |
36,803 | A tool for implementation of a domain model based on fuzzy relationships | cs.CY | The domain model is one of the important components used by adaptive learning
systems to automatically generate customized courses for the learners. In this
paper our contribution is to propose a new tool for implementation of a domain
model based on fuzzy relationships among concepts. This tool allows the experts
and ... | computer science |
36,804 | Worst-case Optimal Query Answering for Greedy Sets of Existential Rules
and Their Subclasses | cs.AI | The need for an ontological layer on top of data, associated with advanced
reasoning mechanisms able to exploit the semantics encoded in ontologies, has
been acknowledged both in the database and knowledge representation
communities. We focus in this paper on the ontological query answering problem,
which consists of q... | computer science |
36,805 | Belief as Willingness to Bet | cs.LO | We investigate modal logics of high probability having two unary modal
operators: an operator $K$ expressing probabilistic certainty and an operator
$B$ expressing probability exceeding a fixed rational threshold $c\geq\frac
12$. Identifying knowledge with the former and belief with the latter, we may
think of $c$ as t... | computer science |
36,806 | Combinatorial Structure of the Deterministic Seriation Method with
Multiple Subset Solutions | cs.AI | Seriation methods order a set of descriptions given some criterion (e.g.,
unimodality or minimum distance between similarity scores). Seriation is thus
inherently a problem of finding the optimal solution among a set of
permutations of objects. In this short technical note, we review the
combinatorial structure of the ... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.