Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
20,002 | Geometric lattice structure of covering and its application to attribute
reduction through matroids | cs.AI | The reduction of covering decision systems is an important problem in data
mining, and covering-based rough sets serve as an efficient technique to
process the problem. Geometric lattices have been widely used in many fields,
especially greedy algorithm design which plays an important role in the
reduction problems. Th... | computer science |
20,003 | Connectedness of graphs and its application to connected matroids
through covering-based rough sets | cs.AI | Graph theoretical ideas are highly utilized by computer science fields
especially data mining. In this field, a data structure can be designed in the
form of tree. Covering is a widely used form of data representation in data
mining and covering-based rough sets provide a systematic approach to this type
of representat... | computer science |
20,004 | Reasoning about the Impacts of Information Sharing | cs.AI | In this paper we describe a decision process framework allowing an agent to
decide what information it should reveal to its neighbours within a
communication graph in order to maximise its utility. We assume that these
neighbours can pass information onto others within the graph. The inferences
made by agents receiving... | computer science |
20,005 | A Cellular Automaton Based Controller for a Ms. Pac-Man Agent | cs.AI | Video games can be used as an excellent test bed for Artificial Intelligence
(AI) techniques. They are challenging and non-deterministic, this makes it very
difficult to write strong AI players. An example of such a video game is Ms.
Pac-Man. In this paper we will outline some of the previous techniques used to
build A... | computer science |
20,006 | Sistem pendukung keputusan kelayakan TKI ke luar negeri menggunakan
FMADM | cs.AI | BP3TKI Palembang is the government agencies that coordinate, execute and
selection of prospective migrants registration and placement. To simplify the
existing procedures and improve decision-making is necessary to build a
decision support system (DSS) to determine eligibility for employment abroad by
applying Fuzzy Mu... | computer science |
20,007 | Skolemization for Weighted First-Order Model Counting | cs.AI | First-order model counting emerged recently as a novel reasoning task, at the
core of efficient algorithms for probabilistic logics. We present a
Skolemization algorithm for model counting problems that eliminates existential
quantifiers from a first-order logic theory without changing its weighted model
count. For cer... | computer science |
20,008 | Conservative, Proportional and Optimistic Contextual Discounting in the
Belief Functions Theory | cs.AI | Information discounting plays an important role in the theory of belief
functions and, generally, in information fusion. Nevertheless, neither
classical uniform discounting nor contextual cannot model certain use cases,
notably temporal discounting. In this article, new contextual discounting
schemes, conservative, pro... | computer science |
20,009 | Giving the AI definition a form suitable for the engineer | cs.AI | Artificial Intelligence - what is this? That is the question! In earlier
papers we already gave a formal definition for AI, but if one desires to build
an actual AI implementation, the following issues require attention and are
treated here: the data format to be used, the idea of Undef and Nothing
symbols, various way... | computer science |
20,010 | Avoiding Confusion between Predictors and Inhibitors in Value Function
Approximation | cs.AI | In reinforcement learning, the goal is to seek rewards and avoid punishments.
A simple scalar captures the value of a state or of taking an action, where
expected future rewards increase and punishments decrease this quantity.
Naturally an agent should learn to predict this quantity to take beneficial
actions, and many... | computer science |
20,011 | Properties of Answer Set Programming with Convex Generalized Atoms | cs.AI | In recent years, Answer Set Programming (ASP), logic programming under the
stable model or answer set semantics, has seen several extensions by
generalizing the notion of an atom in these programs: be it aggregate atoms,
HEX atoms, generalized quantifiers, or abstract constraints, the idea is to
have more complicated s... | computer science |
20,012 | Hybrid Automated Reasoning Tools: from Black-box to Clear-box
Integration | cs.AI | Recently, researchers in answer set programming and constraint programming
spent significant efforts in the development of hybrid languages and solving
algorithms combining the strengths of these traditionally separate fields.
These efforts resulted in a new research area: constraint answer set
programming (CASP). CASP... | computer science |
20,013 | Aspartame: Solving Constraint Satisfaction Problems with Answer Set
Programming | cs.AI | Encoding finite linear CSPs as Boolean formulas and solving them by using
modern SAT solvers has proven to be highly effective, as exemplified by the
award-winning sugar system. We here develop an alternative approach based on
ASP. This allows us to use first-order encodings providing us with a high
degree of flexibili... | computer science |
20,014 | A Functional View of Strong Negation in Answer Set Programming | cs.AI | The distinction between strong negation and default negation has been useful
in answer set programming. We present an alternative account of strong
negation, which lets us view strong negation in terms of the functional stable
model semantics by Bartholomew and Lee. More specifically, we show that, under
complete inter... | computer science |
20,015 | An Algebra of Causal Chains | 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, in a similar spirit than a set of proof trees. The main
contribution of this paper is that we capture justifications into an algebra of
truth v... | computer science |
20,016 | Query Answering in Object Oriented Knowledge Bases in Logic Programming:
Description and Challenge for ASP | cs.AI | Research on developing efficient and scalable ASP solvers can substantially
benefit by the availability of data sets to experiment with. KB_Bio_101
contains knowledge from a biology textbook, has been developed as part of
Project Halo, and has recently become available for research use. KB_Bio_101 is
one of the largest... | computer science |
20,017 | The DIAMOND System for Argumentation: Preliminary Report | cs.AI | Abstract dialectical frameworks (ADFs) are a powerful generalisation of
Dung's abstract argumentation frameworks. In this paper we present an answer
set programming based software system, called DIAMOND (DIAlectical MOdels
eNcoDing). It translates ADFs into answer set programs whose stable models
correspond to models o... | computer science |
20,018 | A System for Interactive Query Answering with Answer Set Programming | cs.AI | Reactive answer set programming has paved the way for incorporating online
information into operative solving processes. Although this technology was
originally devised for dealing with data streams in dynamic environments, like
assisted living and cognitive robotics, it can likewise be used to incorporate
facts, rules... | computer science |
20,019 | Generating Shortest Synchronizing Sequences using Answer Set Programming | cs.AI | For a finite state automaton, a synchronizing sequence is an input sequence
that takes all the states to the same state. Checking the existence of a
synchronizing sequence and finding a synchronizing sequence, if one exists, can
be performed in polynomial time. However, the problem of finding a shortest
synchronizing s... | computer science |
20,020 | Abstract Modular Systems and Solvers | cs.AI | Integrating diverse formalisms into modular knowledge representation systems
offers increased expressivity, modeling convenience and computational benefits.
We introduce concepts of abstract modules and abstract modular systems to study
general principles behind the design and analysis of model-finding programs, or
sol... | computer science |
20,021 | Negation in the Head of CP-logic Rules | cs.AI | CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both
of these logics adhere to a Tarskian informal semantics, in which
interpretations represent objective states-of-affairs. In other words, these
logics lack the epistemic component of ASP, in which interpretations represent
the beliefs or knowled... | computer science |
20,022 | Predictive User Modeling with Actionable Attributes | cs.AI | Different machine learning techniques have been proposed and used for
modeling individual and group user needs, interests and preferences. In the
traditional predictive modeling instances are described by observable
variables, called attributes. The goal is to learn a model for predicting the
target variable for unseen... | computer science |
20,023 | Bounded Rational Decision-Making in Changing Environments | cs.AI | A perfectly rational decision-maker chooses the best action with the highest
utility gain from a set of possible actions. The optimality principles that
describe such decision processes do not take into account the computational
costs of finding the optimal action. Bounded rational decision-making addresses
this proble... | computer science |
20,024 | Bounded Recursive Self-Improvement | cs.AI | We have designed a machine that becomes increasingly better at behaving in
underspecified circumstances, in a goal-directed way, on the job, by modeling
itself and its environment as experience accumulates. Based on principles of
autocatalysis, endogeny, and reflectivity, the work provides an architectural
blueprint fo... | computer science |
20,025 | A New Approach to Constraint Weight Learning for Variable Ordering in
CSPs | cs.AI | A Constraint Satisfaction Problem (CSP) is a framework used for modeling and
solving constrained problems. Tree-search algorithms like backtracking try to
construct a solution to a CSP by selecting the variables of the problem one
after another. The order in which these algorithm select the variables
potentially have s... | computer science |
20,026 | Replica Exchange using q-Gaussian Swarm Quantum Particle Intelligence
Method | cs.AI | We present a newly developed Replica Exchange algorithm using q -Gaussian
Swarm Quantum Particle Optimization (REX@q-GSQPO) method for solving the
problem of finding the global optimum. The basis of the algorithm is to run
multiple copies of independent swarms at different values of q parameter. Based
on an energy crit... | computer science |
20,027 | Proceedings of Answer Set Programming and Other Computing Paradigms
(ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey | cs.AI | This volume contains the papers presented at the sixth workshop on Answer Set
Programming and Other Computing Paradigms (ASPOCP 2013) held on August 25th,
2013 in Istanbul, co-located with the 29th International Conference on Logic
Programming (ICLP 2013). It thus continues a series of previous events
co-located with I... | computer science |
20,028 | Assessment of Customer Credit through Combined Clustering of Artificial
Neural Networks, Genetics Algorithm and Bayesian Probabilities | cs.AI | Today, with respect to the increasing growth of demand to get credit from the
customers of banks and finance and credit institutions, using an effective and
efficient method to decrease the risk of non-repayment of credit given is very
necessary. Assessment of customers' credit is one of the most important and the
most... | computer science |
20,029 | Conceptive Artificial Intelligence: Insights from design theory | cs.AI | The current paper offers a perspective on what we term conceptive
intelligence - the capacity of an agent to continuously think of new object
definitions (tasks, problems, physical systems, etc.) and to look for methods
to realize them. The framework, called a Brouwer machine, is inspired by
previous research in design... | computer science |
20,030 | MTD(f), A Minimax Algorithm Faster Than NegaScout | cs.AI | MTD(f) is a new minimax search algorithm, simpler and more efficient than
previous algorithms. In tests with a number of tournament game playing programs
for chess, checkers and Othello it performed better, on average, than
NegaScout/PVS (the AlphaBeta variant used in practically all good chess,
checkers, and Othello p... | computer science |
20,031 | A New Paradigm for Minimax Search | cs.AI | This paper introduces a new paradigm for minimax game-tree search algo-
rithms. MT is a memory-enhanced version of Pearls Test procedure. By changing
the way MT is called, a number of best-first game-tree search algorithms can be
simply and elegantly constructed (including SSS*). Most of the assessments of
minimax sear... | computer science |
20,032 | SSS* = Alpha-Beta + TT | cs.AI | In 1979 Stockman introduced the SSS* minimax search algorithm that domi-
nates Alpha-Beta in the number of leaf nodes expanded. Further investigation of
the algorithm showed that it had three serious drawbacks, which prevented its
use by practitioners: it is difficult to understand, it has large memory
requirements, an... | computer science |
20,033 | Nearly Optimal Minimax Tree Search? | cs.AI | Knuth and Moore presented a theoretical lower bound on the number of leaves
that any fixed-depth minimax tree-search algorithm traversing a uniform tree
must explore, the so-called minimal tree. Since real-life minimax trees are not
uniform, the exact size of this tree is not known for most applications.
Further, most ... | computer science |
20,034 | Applications of Algorithmic Probability to the Philosophy of Mind | cs.AI | This paper presents formulae that can solve various seemingly hopeless
philosophical conundrums. We discuss the simulation argument, teleportation,
mind-uploading, the rationality of utilitarianism, and the ethics of exploiting
artificial general intelligence. Our approach arises from combining the
essential ideas of f... | computer science |
20,035 | Determining the Consistency factor of Autopilot using Rough Set Theory | cs.AI | Autopilot is a system designed to guide a vehicle without aid. Due to
increase in flight hours and complexity of modern day flight it has become
imperative to equip the aircrafts with autopilot. Thus reliability and
consistency of an Autopilot system becomes a crucial role in a flight. But the
increased complexity and ... | computer science |
20,036 | Plug and Play! A Simple, Universal Model for Energy Disaggregation | cs.AI | Energy disaggregation is to discover the energy consumption of individual
appliances from their aggregated energy values. To solve the problem, most
existing approaches rely on either appliances' signatures or their state
transition patterns, both hard to obtain in practice. Aiming at developing a
simple, universal mod... | computer science |
20,037 | Rational Counterfactuals | cs.AI | This paper introduces the concept of rational countefactuals which is an idea
of identifying a counterfactual from the factual (whether perceived or real)
that maximizes the attainment of the desired consequent. In counterfactual
thinking if we have a factual statement like: Saddam Hussein invaded Kuwait and
consequent... | computer science |
20,038 | The NNN Formalization: Review and Development of Guideline Specification
in the Care Domain | cs.AI | Due to an ageing society, it can be expected that less nursing personnel will
be responsible for an increasing number of patients in the future. One way to
address this challenge is to provide system-based support for nursing personnel
in creating, executing, and adapting patient care processes. In care practice,
these... | computer science |
20,039 | Transparallel mind: Classical computing with quantum power | cs.AI | Inspired by the extraordinary computing power promised by quantum computers,
the quantum mind hypothesis postulated that quantum mechanical phenomena are
the source of neuronal synchronization, which, in turn, might underlie
consciousness. Here, I present an alternative inspired by a classical computing
method with qua... | computer science |
20,040 | Verification of confliction and unreachability in rule-based expert
systems with model checking | cs.AI | It is important to find optimal solutions for structural errors in rule-based
expert systems .Solutions to discovering such errors by using model checking
techniques have already been proposed, but these solutions have problems such
as state space explosion. In this paper, to overcome these problems, we model
the rule-... | computer science |
20,041 | An Integer Programming Model for the Dynamic Location and Relocation of
Emergency Vehicles: A Case Study | cs.AI | In this paper, we address the dynamic Emergency Medical Service (EMS)
systems. A dynamic location model is presented that tries to locate and
relocate the ambulances. The proposed model controls the movements and
locations of ambulances in order to provide a better coverage of the demand
points under different fluctuat... | computer science |
20,042 | Efficient Inference and Learning in a Large Knowledge Base: Reasoning
with Extracted Information using a Locally Groundable First-Order
Probabilistic Logic | cs.AI | One important challenge for probabilistic logics is reasoning with very large
knowledge bases (KBs) of imperfect information, such as those produced by
modern web-scale information extraction systems. One scalability problem shared
by many probabilistic logics is that answering queries involves "grounding" the
query---... | computer science |
20,043 | Distance function of D numbers | cs.AI | Dempster-Shafer theory is widely applied in uncertainty modelling and
knowledge reasoning due to its ability of expressing uncertain information. A
distance between two basic probability assignments(BPAs) presents a measure of
performance for identification algorithms based on the evidential theory of
Dempster-Shafer. ... | computer science |
20,044 | Avoiding Undesired Choices Using Intelligent Adaptive Systems | cs.AI | We propose a number of heuristics that can be used for identifying when
intransitive choice behaviour is likely to occur in choice situations. We also
suggest two methods for avoiding undesired choice behaviour, namely transparent
communication and adaptive choice-set generation. We believe that these two
ways can cont... | computer science |
20,045 | On the Role of Canonicity in Bottom-up Knowledge Compilation | cs.AI | We consider the problem of bottom-up compilation of knowledge bases, which is
usually predicated on the existence of a polytime function for combining
compilations using Boolean operators (usually called an Apply function). While
such a polytime Apply function is known to exist for certain languages (e.g.,
OBDDs) and n... | computer science |
20,046 | An Analysis of State-Relevance Weights and Sampling Distributions on
L1-Regularized Approximate Linear Programming Approximation Accuracy | cs.AI | Recent interest in the use of $L_1$ regularization in the use of value
function approximation includes Petrik et al.'s introduction of
$L_1$-Regularized Approximate Linear Programming (RALP). RALP is unique among
$L_1$-regularized approaches in that it approximates the optimal value function
using off-policy samples. A... | computer science |
20,047 | Ontology as a Source for Rule Generation | cs.AI | This paper discloses the potential of OWL (Web Ontology Language) ontologies
for generation of rules. The main purpose of this paper is to identify new
types of rules, which may be generated from OWL ontologies. Rules, generated
from OWL ontologies, are necessary for the functioning of the Semantic Web
Expert System. I... | computer science |
20,048 | A new combination approach based on improved evidence distance | cs.AI | Dempster-Shafer evidence theory is a powerful tool in information fusion.
When the evidence are highly conflicting, the counter-intuitive results will be
presented. To adress this open issue, a new method based on evidence distance
of Jousselme and Hausdorff distance is proposed. Weight of each evidence can be
computed... | computer science |
20,049 | Generalized Evidence Theory | cs.AI | Conflict management is still an open issue in the application of Dempster
Shafer evidence theory. A lot of works have been presented to address this
issue. In this paper, a new theory, called as generalized evidence theory
(GET), is proposed. Compared with existing methods, GET assumes that the
general situation is in ... | computer science |
20,050 | Shiva++: An Enhanced Graph based Ontology Matcher | cs.AI | With the web getting bigger and assimilating knowledge about different
concepts and domains, it is becoming very difficult for simple database driven
applications to capture the data for a domain. Thus developers have come out
with ontology based systems which can store large amount of information and can
apply reasoni... | computer science |
20,051 | TurKPF: TurKontrol as a Particle Filter | cs.AI | TurKontrol, and algorithm presented in (Dai et al. 2010), uses a POMDP to
model and control an iterative workflow for crowdsourced work. Here, TurKontrol
is re-implemented as "TurKPF," which uses a Particle Filter to reduce
computation time & memory usage. Most importantly, in our experimental
environment with default ... | computer science |
20,052 | Stochastic Privacy | cs.AI | Online services such as web search and e-commerce applications typically rely
on the collection of data about users, including details of their activities on
the web. Such personal data is used to enhance the quality of service via
personalization of content and to maximize revenues via better targeting of
advertisemen... | computer science |
20,053 | An Adversarial Interpretation of Information-Theoretic Bounded
Rationality | cs.AI | Recently, there has been a growing interest in modeling planning with
information constraints. Accordingly, an agent maximizes a regularized expected
utility known as the free energy, where the regularizer is given by the
information divergence from a prior to a posterior policy. While this approach
can be justified in... | computer science |
20,054 | A Comparative study Between Fuzzy Clustering Algorithm and Hard
Clustering Algorithm | cs.AI | Data clustering is an important area of data mining. This is an unsupervised
study where data of similar types are put into one cluster while data of
another types are put into different cluster. Fuzzy C means is a very important
clustering technique based on fuzzy logic. Also we have some hard clustering
techniques av... | computer science |
20,055 | On the Non-Monotonic Description Logic
$\mathcal{ALC}$+T$_{\mathsf{min}}$ | cs.AI | In the last 20 years many proposals have been made to incorporate
non-monotonic reasoning into description logics, ranging from approaches based
on default logic and circumscription to those based on preferential semantics.
In particular, the non-monotonic description logic
$\mathcal{ALC}$+T$_{\mathsf{min}}$ uses a com... | computer science |
20,056 | Hybrid Metaheuristics for the Clustered Vehicle Routing Problem | cs.AI | The Clustered Vehicle Routing Problem (CluVRP) is a variant of the
Capacitated Vehicle Routing Problem in which customers are grouped into
clusters. Each cluster has to be visited once, and a vehicle entering a cluster
cannot leave it until all customers have been visited. This article presents
two alternative hybrid m... | computer science |
20,057 | On Strong and Default Negation in Logic Program Updates (Extended
Version) | cs.AI | Existing semantics for answer-set program updates fall into two categories:
either they consider only strong negation in heads of rules, or they primarily
rely on default negation in heads of rules and optionally provide support for
strong negation by means of a syntactic transformation. In this paper we
pinpoint the l... | computer science |
20,058 | Credulous and Skeptical Argument Games for Complete Semantics in
Conflict Resolution based Argumentation | cs.AI | Argumentation is one of the most popular approaches of defining
a~non-monotonic formalism and several argumentation based semantics were
proposed for defeasible logic programs. Recently, a new approach based on
notions of conflict resolutions was proposed, however with declarative
semantics only. This paper gives a mor... | computer science |
20,059 | Deontic Logic for Human Reasoning | cs.AI | Deontic logic is shown to be applicable for modelling human reasoning. For
this the Wason selection task and the suppression task are discussed in detail.
Different versions of modelling norms with deontic logic are introduced and in
the case of the Wason selection task it is demonstrated how differences in the
perform... | computer science |
20,060 | Preliminary Report on WASP 2.0 | cs.AI | Answer Set Programming (ASP) is a declarative programming paradigm. The
intrinsic complexity of the evaluation of ASP programs makes the development of
more effective and faster systems a challenging research topic. This paper
reports on the recent improvements of the ASP solver WASP. WASP is undergoing a
refactoring p... | computer science |
20,061 | Nonmonotonic Reasoning as a Temporal Activity | cs.AI | A {\it dynamic reasoning system} (DRS) is an adaptation of a conventional
formal logical system that explicitly portrays reasoning as a temporal
activity, with each extralogical input to the system and each inference rule
application being viewed as occurring at a distinct time step. Every DRS
incorporates some well-de... | computer science |
20,062 | Assessing the players'performance in the game of bridge: A fuzzy logic
approach | cs.AI | Contract bridge occupies nowadays a position of great prestige being,
together with chess, the only mind games officially recognized by the
International Olympic Committee. In the present paper an innovative method for
assessing the total performance of bridge- players' belonging to groups of
special interest(e.g. diff... | computer science |
20,063 | Analysis of Dialogical Argumentation via Finite State Machines | cs.AI | Dialogical argumentation is an important cognitive activity by which agents
exchange arguments and counterarguments as part of some process such as
discussion, debate, persuasion and negotiation. Whilst numerous formal systems
have been proposed, there is a lack of frameworks for implementing and
evaluating these propo... | computer science |
20,064 | An argumentation system for reasoning with conflict-minimal
paraconsistent ALC | cs.AI | The semantic web is an open and distributed environment in which it is hard
to guarantee consistency of knowledge and information. Under the standard
two-valued semantics everything is entailed if knowledge and information is
inconsistent. The semantics of the paraconsistent logic LP offers a solution.
However, if the ... | computer science |
20,065 | Compact Argumentation Frameworks | cs.AI | Abstract argumentation frameworks (AFs) are one of the most studied
formalisms in AI. In this work, we introduce a certain subclass of AFs which we
call compact. Given an extension-based semantics, the corresponding compact AFs
are characterized by the feature that each argument of the AF occurs in at
least one extensi... | computer science |
20,066 | n-Valued Refined Neutrosophic Logic and Its Applications to Physics | cs.AI | In this paper we present a short history of logics: from particular cases of
2-symbol or numerical valued logic to the general case of n-symbol or numerical
valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic,
also from the Kleene and Lukasiewicz 3-symbol valued logics or Belnap 4-symbol
valu... | computer science |
20,067 | Possibilities of technologization of philosophical knowledge | cs.AI | Article purpose is the analysis of a question of possibility of
technologization of philosophical knowledge. We understand the organization of
cognitive activity which is guided by the set of methods guaranteed bringing to
successful (i.e. to precisely corresponding set parameters) to applied results
as technologizatio... | computer science |
20,068 | Decision-Making with Complex Data Structures using Probabilistic
Programming | cs.AI | Existing decision-theoretic reasoning frameworks such as decision networks
use simple data structures and processes. However, decisions are often made
based on complex data structures, such as social networks and protein
sequences, and rich processes involving those structures. We present a
framework for representing d... | computer science |
20,069 | Possibility neutrosophic soft sets with applications in decision making
and similarity measure | cs.AI | In this paper, concept of possibility neutrosophic soft set and its
operations are defined, and their properties are studied. An application of
this theory in decision making is investigated. Also a similarity measure of
two possibility neutrosophic soft sets is introduced and discussed. Finally an
application of this ... | computer science |
20,070 | Non-Monotonic Reasoning and Story Comprehension | cs.AI | This paper develops a Reasoning about Actions and Change framework integrated
with Default Reasoning, suitable as a Knowledge Representation and Reasoning
framework for Story Comprehension. The proposed framework, which is guided
strongly by existing knowhow from the Psychology of Reading and Comprehension,
is based on... | computer science |
20,071 | Imparo is complete by inverse subsumption | cs.AI | In Inverse subsumption for complete explanatory induction Yamamoto et al.
investigate which inductive logic programming systems can learn a correct
hypothesis $H$ by using the inverse subsumption instead of inverse entailment.
We prove that inductive logic programming system Imparo is complete by inverse
subsumption fo... | computer science |
20,072 | A Plausibility Semantics for Abstract Argumentation Frameworks | cs.AI | We propose and investigate a simple ranking-measure-based extension semantics
for abstract argumentation frameworks based on their generic instantiation by
default knowledge bases and the ranking construction semantics for default
reasoning. In this context, we consider the path from structured to logical to
shallow se... | computer science |
20,073 | One-Step or Two-Step Optimization and the Overfitting Phenomenon: A Case
Study on Time Series Classification | cs.AI | For the last few decades, optimization has been developing at a fast rate.
Bio-inspired optimization algorithms are metaheuristics inspired by nature.
These algorithms have been applied to solve different problems in engineering,
economics, and other domains. Bio-inspired algorithms have also been applied in
different ... | computer science |
20,074 | Flow for Meta Control | cs.AI | The psychological state of flow has been linked to optimizing human
performance. A key condition of flow emergence is a match between the human
abilities and complexity of the task. We propose a simple computational model
of flow for Artificial Intelligence (AI) agents. The model factors the standard
agent-environment ... | computer science |
20,075 | Representing and Reasoning about Game Strategies | cs.AI | As a contribution to the challenge of building game-playing AI systems, we
develop and analyse a formal language for representing and reasoning about
strategies. Our logical language builds on the existing general Game
Description Language (GDL) and extends it by a standard modality for linear
time along with two dual ... | computer science |
20,076 | Social and Business Intelligence Analysis Using PSO | cs.AI | The goal of this paper is to elaborate swarm intelligence for business
intelligence decision making and the business rules management improvement.
.The swarm optimization, which is highly influenced by the behavior of
creature, performs in group. The Spatial data is defined as data that is
represented by 2D or 3D image... | computer science |
20,077 | M-best solutions for a class of fuzzy constraint satisfaction problems | cs.AI | The article considers one of the possible generalizations of constraint
satisfaction problems where relations are replaced by multivalued membership
functions. In this case operations of disjunction and conjunction are replaced
by maximum and minimum, and consistency of a solution becomes multivalued
rather than binary... | computer science |
20,078 | Fuzzy inference system for integrated VVC in isolated power systems | cs.AI | This paper presents a fuzzy inference system for integrated volt/var control
(VVC) in distribution substations. The purpose is go forward to automation
distribution applying conservation voltage reduction (CVR) in isolated power
systems where control capabilities are limited. A fuzzy controller has been
designed. Worki... | computer science |
20,079 | Extending Acyclicity Notions for Existential Rules (\emph{long version}) | cs.AI | Existential rules have been proposed for representing ontological knowledge,
specifically in the context of Ontology-Based Query Answering. Entailment with
existential rules is undecidable. We focus in this paper on conditions that
ensure the termination of a breadth-first forward chaining algorithm known as
the chase.... | computer science |
20,080 | Modeling and Recognition of Smart Grid Faults by a Combined Approach of
Dissimilarity Learning and One-Class Classification | cs.AI | Detecting faults in electrical power grids is of paramount importance, either
from the electricity operator and consumer viewpoints. Modern electric power
grids (smart grids) are equipped with smart sensors that allow to gather
real-time information regarding the physical status of all the component
elements belonging ... | computer science |
20,081 | Data granulation by the principles of uncertainty | cs.AI | Researches in granular modeling produced a variety of mathematical models,
such as intervals, (higher-order) fuzzy sets, rough sets, and shadowed sets,
which are all suitable to characterize the so-called information granules.
Modeling of the input data uncertainty is recognized as a crucial aspect in
information granu... | computer science |
20,082 | Defining Relative Likelihood in Partially-Ordered Preferential
Structures | cs.AI | Starting with a likelihood or preference order on worlds, we extend it to a
likelihood ordering on sets of worlds in a natural way, and examine the
resulting logic. Lewis (1973) earlier considered such a notion of relative
likelihood in the context of studying counterfactuals, but he assumed a total
preference order on... | computer science |
20,083 | Conditional Plausibility Measures and Bayesian Networks | cs.AI | A general notion of algebraic conditional plausibility measures is defined.
Probability measures, ranking functions, possibility measures, and (under the
appropriate definitions) sets of probability measures can all be viewed as
defining algebraic conditional plausibility measures. It is shown that the
technology of Ba... | computer science |
20,084 | Updating Probabilities | cs.AI | As examples such as the Monty Hall puzzle show, applying conditioning to
update a probability distribution on a ``naive space', which does not take into
account the protocol used, can often lead to counterintuitive results. Here we
examine why. A criterion known as CAR (coarsening at random) in the statistical
literatu... | computer science |
20,085 | Reasoning about Expectation | cs.AI | Expectation is a central notion in probability theory. The notion of
expectation also makes sense for other notions of uncertainty. We introduce a
propositional logic for reasoning about expectation, where the semantics
depends on the underlying representation of uncertainty. We give sound and
complete axiomatizations ... | computer science |
20,086 | A Logic for Reasoning about Evidence | cs.AI | We introduce a logic for reasoning about evidence, that essentially views
evidence as a function from prior beliefs (before making an observation) to
posterior beliefs (after making the observation). We provide a sound and
complete axiomatization for the logic, and consider the complexity of the
decision problem. Altho... | computer science |
20,087 | When Ignorance is Bliss | cs.AI | It is commonly-accepted wisdom that more information is better, and that
information should never be ignored. Here we argue, using both a Bayesian and a
non-Bayesian analysis, that in some situations you are better off ignoring
information if your uncertainty is represented by a set of probability
measures. These inclu... | computer science |
20,088 | Evidence with Uncertain Likelihoods | cs.AI | An agent often has a number of hypotheses, and must choose among them based
on observations, or outcomes of experiments. Each of these observations can be
viewed as providing evidence for or against various hypotheses. All the
attempts to formalize this intuition up to now have assumed that associated
with each hypothe... | computer science |
20,089 | A Game-Theoretic Analysis of Updating Sets of Probabilities | cs.AI | We consider how an agent should update her uncertainty when it is represented
by a set P of probability distributions and the agent observes that a random
variable X takes on value x, given that the agent makes decisions using the
minimax criterion, perhaps the best-studied and most commonly-used criterion in
the liter... | computer science |
20,090 | MDPs with Unawareness | cs.AI | Markov decision processes (MDPs) are widely used for modeling decision-making
problems in robotics, automated control, and economics. Traditional MDPs assume
that the decision maker (DM) knows all states and actions. However, this may
not be true in many situations of interest. We define a new framework, MDPs
with unaw... | computer science |
20,091 | Modular Belief Updates and Confusion about Measures of Certainty in
Artificial Intelligence Research | cs.AI | Over the last decade, there has been growing interest in the use or measures
or change in belief for reasoning with uncertainty in artificial intelligence
research. An important characteristic of several methodologies that reason with
changes in belief or belief updates, is a property that we term modularity. We
call u... | computer science |
20,092 | Graph Transformation Planning via Abstraction | cs.AI | Modern software systems increasingly incorporate self-* behavior to adapt to
changes in the environment at runtime. Such adaptations often involve
reconfiguring the software architecture of the system. Many systems also need
to manage their architecture themselves, i.e., they need a planning component
to autonomously d... | computer science |
20,093 | Backwards State-space Reduction for Planning in Dynamic Knowledge Bases | cs.AI | In this paper we address the problem of planning in rich domains, where
knowledge representation is a key aspect for managing the complexity and size
of the planning domain. We follow the approach of Description Logic (DL) based
Dynamic Knowledge Bases, where a state of the world is represented concisely by
a (possibly... | computer science |
20,094 | Personalization of Itineraries search using Ontology and Rules to Avoid
Congestion in Urban Areas | cs.AI | There is a relatively small amount of research covering urban freight
movements. Most research dealing with the subject of urban mobility focuses on
passenger vehicles, not commercial vehicles hauling freight. However, in many
ways, urban freight transport contributes to congestion, air pollution, noise,
accident and m... | computer science |
20,095 | On computable abstractions (a conceptual introduction) | cs.AI | This paper introduces abstractions that are meaningful for computers and that
can be built and used according to computers' own criteria, i.e., computable
abstractions. It is analyzed how abstractions can be seen to serve as the
building blocks for the creation of one own's understanding of things, which is
essential i... | computer science |
20,096 | A Fuzzy Directional Distance Measure | cs.AI | The measure of distance between two fuzzy sets is a fundamental tool within
fuzzy set theory, however, distance measures currently within the literature
use a crisp value to represent the distance between fuzzy sets. A real valued
distance measure is developed into a fuzzy distance measure which better
reflects the unc... | computer science |
20,097 | Analysing Fuzzy Sets Through Combining Measures of Similarity and
Distance | cs.AI | Reasoning with fuzzy sets can be achieved through measures such as similarity
and distance. However, these measures can often give misleading results when
considered independently, for example giving the same value for two different
pairs of fuzzy sets. This is particularly a problem where many fuzzy sets are
generated... | computer science |
20,098 | Hybrid Systems Knowledge Representation Using Modelling Environment
System Techniques Artificial Intelligence | cs.AI | Knowledge-based or Artificial Intelligence techniques are used increasingly
as alternatives to more classical techniques to model ENVIRONMENTAL SYSTEMS.
Use of Artificial Intelligence (AI) in environmental modelling has increased
with recognition of its potential. In this paper we examine the DIFFERENT
TECHNIQUES of Ar... | computer science |
20,099 | Simulating Non Stationary Operators in Search Algorithms | cs.AI | In this paper, we propose a model for simulating search operators whose
behaviour often changes continuously during the search. In these scenarios, the
performance of the operators decreases when they are applied. This is motivated
by the fact that operators for optimization problems are often roughly
classified into e... | computer science |
20,100 | On Minimax Optimal Offline Policy Evaluation | cs.AI | This paper studies the off-policy evaluation problem, where one aims to
estimate the value of a target policy based on a sample of observations
collected by another policy. We first consider the multi-armed bandit case,
establish a minimax risk lower bound, and analyze the risk of two standard
estimators. It is shown, ... | computer science |
20,101 | Dispute Resolution Using Argumentation-Based Mediation | cs.AI | Mediation is a process, in which both parties agree to resolve their dispute
by negotiating over alternative solutions presented by a mediator. In order to
construct such solutions, mediation brings more information and knowledge, and,
if possible, resources to the negotiation table. The contribution of this paper
is t... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.