Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,407 | Design of a GIS-based Assistant Software Agent for the Incident
Commander to Coordinate Emergency Response Operations | cs.MA | Problem: This paper addresses the design of an intelligent software system
for the IC (incident commander) of a team in order to coordinate actions of
agents (field units or robots) in the domain of emergency/crisis response
operations. Objective: This paper proposes GICoordinator. It is a GIS-based
assistant software ... | computer science |
36,408 | A stochastic model for Case-Based Reasoning | cs.AI | Case-Bsed Reasoning (CBR) is a recent theory for problem-solving and learning
in computers and people.Broadly construed it is the process of solving new
problems based on the solution of similar past problems. In the present paper
we introduce an absorbing Markov chain on the main steps of the CBR process.In
this way w... | computer science |
36,409 | LB2CO: A Semantic Ontology Framework for B2C eCommerce Transaction on
the Internet | cs.CY | Business ontology can enhance the successful development of complex
enterprise system; this is being achieved through knowledge sharing and the
ease of communication between every entity in the domain. Through human
semantic interaction with the web resources, machines to interpret the data
published in a machine inter... | computer science |
36,410 | Solver Scheduling via Answer Set Programming | cs.AI | Although Boolean Constraint Technology has made tremendous progress over the
last decade, the efficacy of state-of-the-art solvers is known to vary
considerably across different types of problem instances and is known to depend
strongly on algorithm parameters. This problem was addressed by means of a
simple, yet effec... | computer science |
36,411 | Constraint Solvers for User Interface Layout | cs.HC | Constraints have played an important role in the construction of GUIs, where
they are mainly used to define the layout of the widgets. Resizing behavior is
very important in GUIs because areas have domain specific parameters such as
form the resizing of windows. If linear objective function is used and window
is resize... | computer science |
36,412 | Learning optimization models in the presence of unknown relations | cs.AI | In a sequential auction with multiple bidding agents, it is highly
challenging to determine the ordering of the items to sell in order to maximize
the revenue due to the fact that the autonomy and private information of the
agents heavily influence the outcome of the auction.
The main contribution of this paper is tw... | computer science |
36,413 | Belief Revision in Structured Probabilistic Argumentation | cs.LO | In real-world applications, knowledge bases consisting of all the information
at hand for a specific domain, along with the current state of affairs, are
bound to contain contradictory data coming from different sources, as well as
data with varying degrees of uncertainty attached. Likewise, an important
aspect of the ... | computer science |
36,414 | Emotional Responses in Artificial Agent-Based Systems: Reflexivity and
Adaptation in Artificial Life | cs.AI | The current work addresses a virtual environment with self-replicating agents
whose decisions are based on a form of "somatic computation" (soma - body) in
which basic emotional responses, taken in parallelism to actual living
organisms, are introduced as a way to provide the agents with greater reflexive
abilities. Th... | computer science |
36,415 | STIMONT: A core ontology for multimedia stimuli description | cs.MM | Affective multimedia documents such as images, sounds or videos elicit
emotional responses in exposed human subjects. These stimuli are stored in
affective multimedia databases and successfully used for a wide variety of
research in psychology and neuroscience in areas related to attention and
emotion processing. Altho... | computer science |
36,416 | Does Restraining End Effect Matter in EMD-Based Modeling Framework for
Time Series Prediction? Some Experimental Evidences | cs.AI | Following the "decomposition-and-ensemble" principle, the empirical mode
decomposition (EMD)-based modeling framework has been widely used as a
promising alternative for nonlinear and nonstationary time series modeling and
prediction. The end effect, which occurs during the sifting process of EMD and
is apt to distort ... | computer science |
36,417 | The Missing Ones: Key Ingredients Towards Effective Ambient Assisted
Living Systems | cs.CY | The population of elderly people keeps increasing rapidly, which becomes a
predominant aspect of our societies. As such, solutions both efficacious and
cost-effective need to be sought. Ambient Assisted Living (AAL) is a new
approach which promises to address the needs from elderly people. In this
paper, we claim that ... | computer science |
36,418 | Networks of Influence Diagrams: A Formalism for Representing Agents'
Beliefs and Decision-Making Processes | cs.GT | This paper presents Networks of Influence Diagrams (NID), a compact, natural
and highly expressive language for reasoning about agents beliefs and
decision-making processes. NIDs are graphical structures in which agents mental
models are represented as nodes in a network; a mental model for an agent may
itself use desc... | computer science |
36,419 | A Unifying Framework for Structural Properties of CSPs: Definitions,
Complexity, Tractability | cs.AI | Literature on Constraint Satisfaction exhibits the definition of several
structural properties that can be possessed by CSPs, like (in)consistency,
substitutability or interchangeability. Current tools for constraint solving
typically detect such properties efficiently by means of incomplete yet
effective algorithms, a... | computer science |
36,420 | Efficient Informative Sensing using Multiple Robots | cs.RO | The need for efficient monitoring of spatio-temporal dynamics in large
environmental applications, such as the water quality monitoring in rivers and
lakes, motivates the use of robotic sensors in order to achieve sufficient
spatial coverage. Typically, these robots have bounded resources, such as
limited battery or li... | computer science |
36,421 | Automated Reasoning in Modal and Description Logics via SAT Encoding:
the Case Study of K(m)/ALC-Satisfiability | cs.LO | In the last two decades, modal and description logics have been applied to
numerous areas of computer science, including knowledge representation, formal
verification, database theory, distributed computing and, more recently,
semantic web and ontologies. For this reason, the problem of automated
reasoning in modal and... | computer science |
36,422 | An Anytime Algorithm for Optimal Coalition Structure Generation | cs.MA | Coalition formation is a fundamental type of interaction that involves the
creation of coherent groupings of distinct, autonomous, agents in order to
efficiently achieve their individual or collective goals. Forming effective
coalitions is a major research challenge in the field of multi-agent systems.
Central to this ... | computer science |
36,423 | Planning over Chain Causal Graphs for Variables with Domains of Size 5
Is NP-Hard | cs.AI | Recently, considerable focus has been given to the problem of determining the
boundary between tractable and intractable planning problems. In this paper, we
study the complexity of planning in the class C_n of planning problems,
characterized by unary operators and directed path causal graphs. Although this
is one of ... | computer science |
36,424 | Variable Forgetting in Reasoning about Knowledge | cs.LO | In this paper, we investigate knowledge reasoning within a simple framework
called knowledge structure. We use variable forgetting as a basic operation for
one agent to reason about its own or other agents\ knowledge. In our framework,
two notions namely agents\ observable variables and the weakest sufficient
condition... | computer science |
36,425 | Prime Implicates and Prime Implicants: From Propositional to Modal Logic | cs.LO | Prime implicates and prime implicants have proven relevant to a number of
areas of artificial intelligence, most notably abductive reasoning and
knowledge compilation. The purpose of this paper is to examine how these
notions might be appropriately extended from propositional logic to the modal
logic K. We begin the pa... | computer science |
36,426 | The Complexity of Circumscription in DLs | cs.LO | As fragments of first-order logic, Description logics (DLs) do not provide
nonmonotonic features such as defeasible inheritance and default rules. Since
many applications would benefit from the availability of such features, several
families of nonmonotonic DLs have been developed that are mostly based on
default logic... | computer science |
36,427 | Modularity Aspects of Disjunctive Stable Models | cs.LO | Practically all programming languages allow the programmer to split a program
into several modules which brings along several advantages in software
development. In this paper, we are interested in the area of answer-set
programming where fully declarative and nonmonotonic languages are applied. In
this context, obtain... | computer science |
36,428 | Hypertableau Reasoning for Description Logics | cs.LO | We present a novel reasoning calculus for the description logic SHOIQ^+---a
knowledge representation formalism with applications in areas such as the
Semantic Web. Unnecessary nondeterminism and the construction of large models
are two primary sources of inefficiency in the tableau-based reasoning calculi
used in state... | computer science |
36,429 | The DL-Lite Family and Relations | cs.LO | The recently introduced series of description logics under the common moniker
DL-Lite has attracted attention of the description logic and semantic web
communities due to the low computational complexity of inference, on the one
hand, and the ability to represent conceptual modeling formalisms, on the
other. The main a... | computer science |
36,430 | Modeling Concept Combinations in a Quantum-theoretic Framework | cs.AI | We present modeling for conceptual combinations which uses the mathematical
formalism of quantum theory. Our model faithfully describes a large amount of
experimental data collected by different scholars on concept conjunctions and
disjunctions. Furthermore, our approach sheds a new light on long standing
drawbacks con... | computer science |
36,431 | Reasoning About the Transfer of Control | cs.AI | We present DCL-PC: a logic for reasoning about how the abilities of agents
and coalitions of agents are altered by transferring control from one agent to
another. The logical foundation of DCL-PC is CL-PC, a logic for reasoning about
cooperation in which the abilities of agents and coalitions of agents stem from
a dist... | computer science |
36,432 | Grounding FO and FO(ID) with Bounds | cs.LO | Grounding is the task of reducing a first-order theory and finite domain to
an equivalent propositional theory. It is used as preprocessing phase in many
logic-based reasoning systems. Such systems provide a rich first-order input
language to a user and can rely on efficient propositional solvers to perform
the actual ... | computer science |
36,433 | Theta*: Any-Angle Path Planning on Grids | cs.CG | Grids with blocked and unblocked cells are often used to represent terrain in
robotics and video games. However, paths formed by grid edges can be longer
than true shortest paths in the terrain since their headings are artificially
constrained. We present two new correct and complete any-angle path-planning
algorithms ... | computer science |
36,434 | Multiattribute Auctions Based on Generalized Additive Independence | cs.GT | We develop multiattribute auctions that accommodate generalized additive
independent (GAI) preferences. We propose an iterative auction mechanism that
maintains prices on potentially overlapping GAI clusters of attributes, thus
decreases elicitation and computational burden, and creates an open competition
among suppli... | computer science |
36,435 | Resource-Driven Mission-Phasing Techniques for Constrained Agents in
Stochastic Environments | cs.MA | Because an agents resources dictate what actions it can possibly take, it
should plan which resources it holds over time carefully, considering its
inherent limitations (such as power or payload restrictions), the competing
needs of other agents for the same resources, and the stochastic nature of the
environment. Such... | computer science |
36,436 | Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity
is your Friend! | cs.LO | Description Logics are knowledge representation formalisms that provide, for
example, the logical underpinning of the W3C OWL standards. Conjunctive
queries, the standard query language in databases, have recently gained
significant attention as an expressive formalism for querying Description Logic
knowledge bases. Se... | computer science |
36,437 | Intrusion Detection using Continuous Time Bayesian Networks | cs.AI | Intrusion detection systems (IDSs) fall into two high-level categories:
network-based systems (NIDS) that monitor network behaviors, and host-based
systems (HIDS) that monitor system calls. In this work, we present a general
technique for both systems. We use anomaly detection, which identifies patterns
not conforming ... | computer science |
36,438 | Algorithms for Closed Under Rational Behavior (CURB) Sets | cs.GT | We provide a series of algorithms demonstrating that solutions according to
the fundamental game-theoretic solution concept of closed under rational
behavior (CURB) sets in two-player, normal-form games can be computed in
polynomial time (we also discuss extensions to n-player games). First, we
describe an algorithm th... | computer science |
36,439 | Logical Foundations of RDF(S) with Datatypes | cs.LO | The Resource Description Framework (RDF) is a Semantic Web standard that
provides a data language, simply called RDF, as well as a lightweight ontology
language, called RDF Schema. We investigate embeddings of RDF in logic and show
how standard logic programming and description logic technology can be used for
reasonin... | computer science |
36,440 | Best-First Heuristic Search for Multicore Machines | cs.AI | To harness modern multicore processors, it is imperative to develop parallel
versions of fundamental algorithms. In this paper, we compare different
approaches to parallel best-first search in a shared-memory setting. We present
a new method, PBNF, that uses abstraction to partition the state space and to
detect duplic... | computer science |
36,441 | A Logical Study of Partial Entailment | cs.LO | We introduce a novel logical notion--partial entailment--to propositional
logic. In contrast with classical entailment, that a formula P partially
entails another formula Q with respect to a background formula set \Gamma
intuitively means that under the circumstance of \Gamma, if P is true then some
"part" of Q will al... | computer science |
36,442 | Clause-Learning Algorithms with Many Restarts and Bounded-Width
Resolution | cs.LO | We offer a new understanding of some aspects of practical SAT-solvers that
are based on DPLL with unit-clause propagation, clause-learning, and restarts.
We do so by analyzing a concrete algorithm which we claim is faithful to what
practical solvers do. In particular, before making any new decision or restart,
the solv... | computer science |
36,443 | Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories | cs.LO | The problem of finding small unsatisfiable cores for SAT formulas has
recently received a lot of interest, mostly for its applications in formal
verification. However, propositional logic is often not expressive enough for
representing many interesting verification problems, which can be more
naturally addressed in the... | computer science |
36,444 | Soft Constraints of Difference and Equality | cs.AI | In many combinatorial problems one may need to model the diversity or
similarity of assignments in a solution. For example, one may wish to maximise
or minimise the number of distinct values in a solution. To formulate problems
of this type, we can use soft variants of the well known AllDifferent and
AllEqual constrain... | computer science |
36,445 | The Complexity of Integer Bound Propagation | cs.AI | Bound propagation is an important Artificial Intelligence technique used in
Constraint Programming tools to deal with numerical constraints. It is
typically embedded within a search procedure ("branch and prune") and used at
every node of the search tree to narrow down the search space, so it is
critical that it be fas... | computer science |
36,446 | Interpolable Formulas in Equilibrium Logic and Answer Set Programming | cs.LO | Interpolation is an important property of classical and many non-classical
logics that has been shown to have interesting applications in computer science
and AI. Here we study the Interpolation Property for the the non-monotonic
system of equilibrium logic, establishing weaker or stronger forms of
interpolation depend... | computer science |
36,447 | First-Order Stable Model Semantics and First-Order Loop Formulas | cs.LO | Lin and Zhaos theorem on loop formulas states that in the propositional case
the stable model semantics of a logic program can be completely characterized
by propositional loop formulas, but this result does not fully carry over to
the first-order case. We investigate the precise relationship between the
first-order st... | computer science |
36,448 | Decidability and Undecidability Results for Propositional Schemata | cs.LO | We define a logic of propositional formula schemata adding to the syntax of
propositional logic indexed propositions and iterated connectives ranging over
intervals parameterized by arithmetic variables. The satisfiability problem is
shown to be undecidable for this new logic, but we introduce a very general
class of s... | computer science |
36,449 | Defeasible Inclusions in Low-Complexity DLs | cs.LO | Some of the applications of OWL and RDF (e.g. biomedical knowledge
representation and semantic policy formulation) call for extensions of these
languages with nonmonotonic constructs such as inheritance with overriding.
Nonmonotonic description logics have been studied for many years, however no
practical such knowledg... | computer science |
36,450 | On the Link between Partial Meet, Kernel, and Infra Contraction and its
Application to Horn Logic | cs.AI | Standard belief change assumes an underlying logic containing full classical
propositional logic. However, there are good reasons for considering belief
change in less expressive logics as well. In this paper we build on recent
investigations by Delgrande on contraction for Horn logic. We show that the
standard basic f... | computer science |
36,451 | Making Decisions Using Sets of Probabilities: Updating, Time
Consistency, and Calibration | cs.AI | We consider how an agent should update her beliefs when her beliefs are
represented by a set P of probability distributions, given that the agent makes
decisions using the minimax criterion, perhaps the best-studied and most
commonly-used criterion in the literature. We adopt a game-theoretic framework,
where the agent... | computer science |
36,452 | Scheduling Bipartite Tournaments to Minimize Total Travel Distance | cs.AI | In many professional sports leagues, teams from opposing leagues/conferences
compete against one another, playing inter-league games. This is an example of
a bipartite tournament. In this paper, we consider the problem of reducing the
total travel distance of bipartite tournaments, by analyzing inter-league
scheduling ... | computer science |
36,453 | Location-Based Reasoning about Complex Multi-Agent Behavior | cs.MA | Recent research has shown that surprisingly rich models of human activity can
be learned from GPS (positional) data. However, most effort to date has
concentrated on modeling single individuals or statistical properties of groups
of people. Moreover, prior work focused solely on modeling actual successful
executions (a... | computer science |
36,454 | Unfounded Sets and Well-Founded Semantics of Answer Set Programs with
Aggregates | cs.LO | Logic programs with aggregates (LPA) are one of the major linguistic
extensions to Logic Programming (LP). In this work, we propose a generalization
of the notions of unfounded set and well-founded semantics for programs with
monotone and antimonotone aggregates (LPAma programs). In particular, we
present a new notion ... | computer science |
36,455 | Learning and Reasoning with Action-Related Places for Robust Mobile
Manipulation | cs.RO | We propose the concept of Action-Related Place (ARPlace) as a powerful and
flexible representation of task-related place in the context of mobile
manipulation. ARPlace represents robot base locations not as a single position,
but rather as a collection of positions, each with an associated probability
that the manipula... | computer science |
36,456 | Completeness Guarantees for Incomplete Ontology Reasoners: Theory and
Practice | cs.AI | To achieve scalability of query answering, the developers of Semantic Web
applications are often forced to use incomplete OWL 2 reasoners, which fail to
derive all answers for at least one query, ontology, and data set. The lack of
completeness guarantees, however, may be unacceptable for applications in areas
such as ... | computer science |
36,457 | Consistency Techniques for Flow-Based Projection-Safe Global Cost
Functions in Weighted Constraint Satisfaction | cs.AI | Many combinatorial problems deal with preferences and violations, the goal of
which is to find solutions with the minimum cost. Weighted constraint
satisfaction is a framework for modeling such problems, which consists of a set
of cost functions to measure the degree of violation or preferences of
different combination... | computer science |
36,458 | Reformulating the Situation Calculus and the Event Calculus in the
General Theory of Stable Models and in Answer Set Programming | cs.AI | Circumscription and logic programs under the stable model semantics are two
well-known nonmonotonic formalisms. The former has served as a basis of
classical logic based action formalisms, such as the situation calculus, the
event calculus and temporal action logics; the latter has served as a basis of
a family of acti... | computer science |
36,459 | Computing All-Pairs Shortest Paths by Leveraging Low Treewidth | cs.DS | We present two new and efficient algorithms for computing all-pairs shortest
paths. The algorithms operate on directed graphs with real (possibly negative)
weights. They make use of directed path consistency along a vertex ordering d.
Both algorithms run in O(n^2 w_d) time, where w_d is the graph width induced by
this ... | computer science |
36,460 | Local Consistency and SAT-Solvers | cs.AI | Local consistency techniques such as k-consistency are a key component of
specialised solvers for constraint satisfaction problems. In this paper we show
that the power of using k-consistency techniques on a constraint satisfaction
problem is precisely captured by using a particular inference rule, which we
call negati... | computer science |
36,461 | A Scalable Conditional Independence Test for Nonlinear, Non-Gaussian
Data | cs.AI | Many relations of scientific interest are nonlinear, and even in linear
systems distributions are often non-Gaussian, for example in fMRI BOLD data. A
class of search procedures for causal relations in high dimensional data relies
on sample derived conditional independence decisions. The most common
applications rely o... | computer science |
36,462 | A Microkernel Architecture for Constraint Programming | cs.AI | This paper presents a microkernel architecture for constraint programming
organized around a number of small number of core functionalities and minimal
interfaces. The architecture contrasts with the monolithic nature of many
implementations. Experimental results indicate that the software engineering
benefits are not ... | computer science |
36,463 | Domain Views for Constraint Programming | cs.AI | Views are a standard abstraction in constraint programming: They make it
possible to implement a single version of each constraint, while avoiding to
create new variables and constraints that would slow down propagation.
Traditional constraint-programming systems provide the concept of {\em variable
views} which implem... | computer science |
36,464 | The Logical Difference for the Lightweight Description Logic EL | cs.LO | We study a logic-based approach to versioning of ontologies. Under this view,
ontologies provide answers to queries about some vocabulary of interest. The
difference between two versions of an ontology is given by the set of queries
that receive different answers. We investigate this approach for terminologies
given in... | computer science |
36,465 | Algorithms for Generating Ordered Solutions for Explicit AND/OR
Structures | cs.AI | We present algorithms for generating alternative solutions for explicit
acyclic AND/OR structures in non-decreasing order of cost. The proposed
algorithms use a best first search technique and report the solutions using an
implicit representation ordered by cost. In this paper, we present two versions
of the search alg... | computer science |
36,466 | Reasoning over Ontologies with Hidden Content: The Import-by-Query
Approach | cs.AI | There is currently a growing interest in techniques for hiding parts of the
signature of an ontology Kh that is being reused by another ontology Kv.
Towards this goal, in this paper we propose the import-by-query framework,
which makes the content of Kh accessible through a limited query interface. If
Kv reuses the sym... | computer science |
36,467 | Tractable Triangles and Cross-Free Convexity in Discrete Optimisation | cs.CC | The minimisation problem of a sum of unary and pairwise functions of discrete
variables is a general NP-hard problem with wide applications such as computing
MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or
solving binary Valued Constraint Satisfaction Problems (VCSPs).
We study the compu... | computer science |
36,468 | SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in
Business Process Management | cs.AI | Planning is concerned with the automated solution of action sequencing
problems described in declarative languages giving the action preconditions and
effects. One important application area for such technology is the creation of
new processes in Business Process Management (BPM), which is essential in an
ever more dyn... | computer science |
36,469 | An adaptive Simulated Annealing-based satellite observation scheduling
method combined with a dynamic task clustering strategy | cs.AI | Efficient scheduling is of great significance to rationally make use of
scarce satellite resources. Task clustering has been demonstrated to realize an
effective strategy to improve the efficiency of satellite scheduling. However,
the previous task clustering strategy is static. That is, it is integrated into
the sched... | computer science |
36,470 | Using Neural Network to Propose Solutions to Threats in Attack Patterns | cs.CR | In the last decade, a lot of effort has been put into securing software
application during development in the software industry. Software security is a
research field in this area which looks at how security can be weaved into
software at each phase of software development lifecycle (SDLC). The use of
attack patterns i... | computer science |
36,471 | Hypergraph Acyclicity and Propositional Model Counting | cs.CC | We show that the propositional model counting problem #SAT for CNF- formulas
with hypergraphs that allow a disjoint branches decomposition can be solved in
polynomial time. We show that this class of hypergraphs is incomparable to
hypergraphs of bounded incidence cliquewidth which were the biggest class of
hypergraphs ... | computer science |
36,472 | Quality of Geographic Information: Ontological approach and Artificial
Intelligence Tools | cs.AI | The objective is to present one important aspect of the European IST-FET
project "REV!GIS"1: the methodology which has been developed for the
translation (interpretation) of the quality of the data into a "fitness for
use" information, that we can confront to the user needs in its application.
This methodology is based... | computer science |
36,473 | Customizable Contraction Hierarchies | cs.DS | We consider the problem of quickly computing shortest paths in weighted
graphs given auxiliary data derived in an expensive preprocessing phase. By
adding a fast weight-customization phase, we extend Contraction Hierarchies by
Geisberger et al to support the three-phase workflow introduced by Delling et
al. Our Customi... | computer science |
36,474 | Optimal Rectangle Packing: An Absolute Placement Approach | cs.AI | We consider the problem of finding all enclosing rectangles of minimum area
that can contain a given set of rectangles without overlap. Our rectangle
packer chooses the x-coordinates of all the rectangles before any of the
y-coordinates. We then transform the problem into a perfect-packing problem
with no empty space b... | computer science |
36,475 | Description Logic Knowledge and Action Bases | cs.AI | Description logic Knowledge and Action Bases (KAB) are a mechanism for
providing both a semantically rich representation of the information on the
domain of interest in terms of a description logic knowledge base and actions
to change such information over time, possibly introducing new objects. We
resort to a variant ... | computer science |
36,476 | Reasoning about Explanations for Negative Query Answers in DL-Lite | cs.AI | In order to meet usability requirements, most logic-based applications
provide explanation facilities for reasoning services. This holds also for
Description Logics, where research has focused on the explanation of both TBox
reasoning and, more recently, query answering. Besides explaining the presence
of a tuple in a ... | computer science |
36,477 | Optimizing SPARQL Query Answering over OWL Ontologies | cs.DB | The SPARQL query language is currently being extended by the World Wide Web
Consortium (W3C) with so-called entailment regimes. An entailment regime
defines how queries are evaluated under more expressive semantics than SPARQLs
standard simple entailment, which is based on subgraph matching. The queries
are very expres... | computer science |
36,478 | NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover | cs.AI | The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial
optimization problem of great importance in both theory and application. Local
search has proved successful for this problem. However, there are two main
drawbacks in state-of-the-art MVC local search algorithms. First, they select a
pair of ve... | computer science |
36,479 | A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph
Classes and Beyond | cs.AI | The causal graph of a planning instance is an important tool for planning
both in practice and in theory. The theoretical studies of causal graphs have
largely analysed the computational complexity of planning for instances where
the causal graph has a certain structure, often in combination with other
parameters like ... | computer science |
36,480 | Learning by Observation of Agent Software Images | cs.AI | Learning by observation can be of key importance whenever agents sharing
similar features want to learn from each other. This paper presents an agent
architecture that enables software agents to learn by direct observation of the
actions executed by expert agents while they are performing a task. This is
possible becau... | computer science |
36,481 | User Friendly Line CAPTCHAs | cs.HC | CAPTCHAs or reverse Turing tests are real-time assessments used by programs
(or computers) to tell humans and machines apart. This is achieved by assigning
and assessing hard AI problems that could only be solved easily by human but
not by machines. Applications of such assessments range from stopping spammers
from aut... | computer science |
36,482 | Frequency-Based Patrolling with Heterogeneous Agents and Limited
Communication | cs.MA | This paper investigates multi-agent frequencybased patrolling of
intersecting, circle graphs under conditions where graph nodes have non-uniform
visitation requirements and agents have limited ability to communicate. The
task is modeled as a partially observable Markov decision process, and a
reinforcement learning sol... | computer science |
36,483 | Relations on FP-Soft Sets Applied to Decision Making Problems | math.LO | In this work, we first define relations on the fuzzy parametrized soft sets
and study their properties. We also give a decision making method based on
these relations. In approximate reasoning, relations on the fuzzy parametrized
soft sets have shown to be of a primordial importance. Finally, the method is
successfully... | computer science |
36,484 | Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal
Environment | cs.AI | Avoiding collisions is one of the vital tasks for systems of autonomous
mobile agents. We focus on the problem of finding continuous coordinated paths
for multiple mobile disc agents in a 2-d environment with polygonal obstacles.
The problem is PSPACE-hard, with the state space growing exponentially in the
number of ag... | computer science |
36,485 | Towards Ultra Rapid Restarts | cs.AI | We observe a trend regarding restart strategies used in SAT solvers. A few
years ago, most state-of-the-art solvers restarted on average after a few
thousands of backtracks. Currently, restarting after a dozen backtracks results
in much better performance. The main reason for this trend is that heuristics
and data stru... | computer science |
36,486 | Symbiosis of Search and Heuristics for Random 3-SAT | cs.DS | When combined properly, search techniques can reveal the full potential of
sophisticated branching heuristics. We demonstrate this observation on the
well-known class of random 3-SAT formulae. First, a new branching heuristic is
presented, which generalizes existing work on this class. Much smaller search
trees can be ... | computer science |
36,487 | Concurrent Cube-and-Conquer | cs.DS | Recent work introduced the cube-and-conquer technique to solve hard SAT
instances. It partitions the search space into cubes using a lookahead solver.
Each cube is tackled by a conflict-driven clause learning (CDCL) solver.
Crucial for strong performance is the cutoff heuristic that decides when to
switch from lookahea... | computer science |
36,488 | A normative account of defeasible and probabilistic inference | cs.LO | In this paper, we provide more evidence for the contention that logical
consequence should be understood in normative terms. Hartry Field and John
MacFarlane covered the classical case. We extend their work, examining what it
means for an agent to be obliged to infer a conclusion when faced with
uncertain information o... | computer science |
36,489 | The Application of Imperialist Competitive Algorithm for Fuzzy Random
Portfolio Selection Problem | math.OC | This paper presents an implementation of the Imperialist Competitive
Algorithm (ICA) for solving the fuzzy random portfolio selection problem where
the asset returns are represented by fuzzy random variables. Portfolio
Optimization is an important research field in modern finance. By using the
necessity-based model, fu... | computer science |
36,490 | Using the Crowd to Generate Content for Scenario-Based Serious-Games | cs.AI | In the last decade, scenario-based serious-games have become a main tool for
learning new skills and capabilities. An important factor in the development of
such systems is the overhead in time, cost and human resources to manually
create the content for these scenarios. We focus on how to create content for
scenarios ... | computer science |
36,491 | Interpreting social cues to generate credible affective reactions of
virtual job interviewers | cs.AI | In this paper we describe a mechanism of generating credible affective
reactions in a virtual recruiter during an interaction with a user. This is
done using communicative performance computation based on the behaviours of the
user as detected by a recognition module. The proposed software pipeline is
part of the TARDI... | computer science |
36,492 | Statistical Constraints | cs.AI | We introduce statistical constraints, a declarative modelling tool that links
statistics and constraint programming. We discuss two statistical constraints
and some associated filtering algorithms. Finally, we illustrate applications
to standard problems encountered in statistics and to a novel inspection
scheduling pr... | computer science |
36,493 | A Survey on Dynamic Job Scheduling in Grid Environment Based on
Heuristic Algorithms | cs.DC | Computational Grids are a new trend in distributed computing systems. They
allow the sharing of geographically distributed resources in an efficient way,
extending the boundaries of what we perceive as distributed computing. Various
sciences can benefit from the use of grids to solve CPU-intensive problems,
creating po... | computer science |
36,494 | Characterizing and computing stable models of logic programs: The
non-stratified case | cs.AI | Stable Logic Programming (SLP) is an emergent, alternative style of logic
programming: each solution to a problem is represented by a stable model of a
deductive database/function-free logic program encoding the problem itself.
Several implementations now exist for stable logic programming, and their
performance is rap... | computer science |
36,495 | Friend Inspector: A Serious Game to Enhance Privacy Awareness in Social
Networks | cs.CY | Currently, many users of Social Network Sites are insufficiently aware of who
can see their shared personal items. Nonetheless, most approaches focus on
enhancing privacy in Social Networks through improved privacy settings,
neglecting the fact that privacy awareness is a prerequisite for privacy
control. Social Networ... | computer science |
36,496 | A predictive analytics approach to reducing avoidable hospital
readmission | stat.AP | Hospital readmission has become a critical metric of quality and cost of
healthcare. Medicare anticipates that nearly $17 billion is paid out on the 20%
of patients who are readmitted within 30 days of discharge. Although several
interventions such as transition care management and discharge reengineering
have been pra... | computer science |
36,497 | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in
Abstract Argumentation | cs.DS | We study the computational complexity of problems that arise in abstract
argumentation in the context of dynamic argumentation, minimal change, and
aggregation. In particular, we consider the following problems where always an
argumentation framework F and a small positive integer k are given.
- The Repair problem as... | computer science |
36,498 | Enaction-Based Artificial Intelligence: Toward Coevolution with Humans
in the Loop | cs.AI | This article deals with the links between the enaction paradigm and
artificial intelligence. Enaction is considered a metaphor for artificial
intelligence, as a number of the notions which it deals with are deemed
incompatible with the phenomenal field of the virtual. After explaining this
stance, we shall review previ... | computer science |
36,499 | Robot Location Estimation in the Situation Calculus | cs.AI | Location estimation is a fundamental sensing task in robotic applications,
where the world is uncertain, and sensors and effectors are noisy. Most systems
make various assumptions about the dependencies between state variables, and
especially about how these dependencies change as a result of actions. Building
on a gen... | computer science |
36,500 | Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel
Approach | cs.PL | We propose a timed and soft extension of Concurrent Constraint Programming.
The time extension is based on the hypothesis of bounded asynchrony: the
computation takes a bounded period of time and is measured by a discrete global
clock. Action prefixing is then considered as the syntactic marker which
distinguishes a ti... | computer science |
36,501 | New Ideas for Brain Modelling | cs.AI | This paper describes some biologically-inspired processes that could be used
to build the sort of networks that we associate with the human brain. New to
this paper, a 'refined' neuron will be proposed. This is a group of neurons
that by joining together can produce a more analogue system, but with the same
level of co... | computer science |
36,502 | A Novel Method for Comparative Analysis of DNA Sequences by
Ramanujan-Fourier Transform | cs.CE | Alignment-free sequence analysis approaches provide important alternatives
over multiple sequence alignment (MSA) in biological sequence analysis because
alignment-free approaches have low computation complexity and are not dependent
on high level of sequence identity, however, most of the existing
alignment-free metho... | computer science |
36,503 | Sensing Subjective Well-being from Social Media | cs.AI | Subjective Well-being(SWB), which refers to how people experience the quality
of their lives, is of great use to public policy-makers as well as economic,
sociological research, etc. Traditionally, the measurement of SWB relies on
time-consuming and costly self-report questionnaires. Nowadays, people are
motivated to s... | computer science |
36,504 | Belief-Rule-Based Expert Systems for Evaluation of E- Government: A Case
Study | cs.AI | Little knowledge exists on the impact and results associated with
e-government projects in many specific use domains. Therefore it is necessary
to evaluate the efficiency and effectiveness of e-government systems. Since the
development of e-government is a continuous process of improvement, it requires
continuous evalu... | computer science |
36,505 | Enhancing Automated Decision Support across Medical and Oral Health
Domains with Semantic Web Technologies | cs.AI | Research has shown that the general health and oral health of an individual
are closely related. Accordingly, current practice of isolating the information
base of medical and oral health domains can be dangerous and detrimental to the
health of the individual. However, technical issues such as heterogeneous data
colle... | computer science |
36,506 | LTLf and LDLf Monitoring: A Technical Report | cs.AI | Runtime monitoring is one of the central tasks to provide operational
decision support to running business processes, and check on-the-fly whether
they comply with constraints and rules. We study runtime monitoring of
properties expressed in LTL on finite traces (LTLf) and in its extension LDLf.
LDLf is a powerful logi... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.