Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,706 | Proof System for Plan Verification under 0-Approximation Semantics | cs.AI | In this paper a proof system is developed for plan verification problems
$\{X\}c\{Y\}$ and $\{X\}c\{KW p\}$ under 0-approximation semantics for
${\mathcal A}_K$. Here, for a plan $c$, two sets $X,Y$ of fluent literals, and
a literal $p$, $\{X\}c\{Y\}$ (resp. $\{X\}c\{KW p\}$) means that all literals
of $Y$ become true ... | computer science |
35,707 | Every Formula-Based Logic Program Has a Least Infinite-Valued Model | cs.LO | Every definite logic program has as its meaning a least Herbrand model with
respect to the program-independent ordering "set-inclusion". In the case of
normal logic programs there do not exist least models in general. However,
according to a recent approach by Rondogiannis and Wadge, who consider
infinite-valued models... | computer science |
35,708 | On the Parameterized Complexity of Default Logic and Autoepistemic Logic | cs.CC | We investigate the application of Courcelle's Theorem and the logspace
version of Elberfeld etal. in the context of the implication problem for
propositional sets of formulae, the extension existence problem for default
logic, as well as the expansion existence problem for autoepistemic logic and
obtain fixed-parameter... | computer science |
35,709 | Predicting User Actions in Software Processes | cs.SE | This paper describes an approach for user (e.g. SW architect) assisting in
software processes. The approach observes the user's action and tries to
predict his next step. For this we use approaches in the area of machine
learning (sequence learning) and adopt these for the use in software processes.
Keywords: Softwar... | computer science |
35,710 | Discovering patterns of correlation and similarities in software project
data with the Circos visualization tool | cs.SE | Software cost estimation based on multivariate data from completed projects
requires the building of efficient models. These models essentially describe
relations in the data, either on the basis of correlations between variables or
of similarities between the projects. The continuous growth of the amount of
data gathe... | computer science |
35,711 | Open Source Software: How Can Design Metrics Facilitate Architecture
Recovery? | cs.SE | Modern software development methodologies include reuse of open source code.
Reuse can be facilitated by architectural knowledge of the software, not
necessarily provided in the documentation of open source software. The effort
required to comprehend the system's source code and discover its architecture
can be conside... | computer science |
35,712 | Multiple ant-bee colony optimization for load balancing in
packet-switched networks | cs.NI | One of the important issues in computer networks is "Load Balancing" which
leads to efficient use of the network resources. To achieve a balanced network
it is necessary to find different routes between the source and destination. In
the current paper we propose a new approach to find different routes using
swarm intel... | computer science |
35,713 | Bi-modal Gödel logic over [0,1]-valued Kripke frames | math.LO | We consider the G\"odel bi-modal logic determined by fuzzy Kripke models
where both the propositions and the accessibility relation are infinitely
valued over the standard G\"odel algebra [0,1] and prove strong completeness of
Fischer Servi intuitionistic modal logic IK plus the prelinearity axiom with
respect to this ... | computer science |
35,714 | Auctions with Severely Bounded Communication | cs.GT | We study auctions with severe bounds on the communication allowed: each
bidder may only transmit t bits of information to the auctioneer. We consider
both welfare- and profit-maximizing auctions under this communication
restriction. For both measures, we determine the optimal auction and show that
the loss incurred rel... | computer science |
35,715 | Multi-Issue Negotiation with Deadlines | cs.MA | This paper studies bilateral multi-issue negotiation between self-interested
autonomous agents. Now, there are a number of different procedures that can be
used for this process; the three main ones being the package deal procedure in
which all the issues are bundled and discussed together, the simultaneous
procedure i... | computer science |
35,716 | Resource Allocation Among Agents with MDP-Induced Preferences | cs.MA | Allocating scarce resources among agents to maximize global utility is, in
general, computationally challenging. We focus on problems where resources
enable agents to execute actions in stochastic environments, modeled as Markov
decision processes (MDPs), such that the value of a resource bundle is defined
as the expec... | computer science |
35,717 | Reasoning about Actions with Temporal Answer Sets | cs.AI | In this paper we combine Answer Set Programming (ASP) with Dynamic Linear
Time Temporal Logic (DLTL) to define a temporal logic programming language for
reasoning about complex actions and infinite computations. DLTL extends
propositional temporal logic of linear time with regular programs of
propositional dynamic logi... | computer science |
35,718 | The Complexification of Engineering | nlin.AO | This paper deals with the arrow of complexification of engineering. We claim
that the complexification of engineering consists in (a) that shift throughout
which engineering becomes a science; thus it ceases to be a (mere) praxis or
profession; (b) becoming a science, engineering can be considered as one of the
science... | computer science |
35,719 | A Version of Geiringer-like Theorem for Decision Making in the
Environments with Randomness and Incomplete Information | cs.AI | Purpose: In recent years Monte-Carlo sampling methods, such as Monte Carlo
tree search, have achieved tremendous success in model free reinforcement
learning. A combination of the so called upper confidence bounds policy to
preserve the "exploration vs. exploitation" balance to select actions for
sample evaluations tog... | computer science |
35,720 | Query-time Entity Resolution | cs.DB | Entity resolution is the problem of reconciling database references
corresponding to the same real-world entities. Given the abundance of publicly
available databases that have unresolved entities, we motivate the problem of
query-time entity resolution quick and accurate resolution for answering
queries over such uncl... | computer science |
35,721 | CTL Model Update for System Modifications | cs.AI | Model checking is a promising technology, which has been applied for
verification of many hardware and software systems. In this paper, we introduce
the concept of model update towards the development of an automatic system
modification tool that extends model checking functions. We define primitive
update operations o... | computer science |
35,722 | Applying Fuzzy ID3 Decision Tree for Software Effort Estimation | cs.SE | Web Effort Estimation is a process of predicting the efforts and cost in
terms of money, schedule and staff for any software project system. Many
estimation models have been proposed over the last three decades and it is
believed that it is a must for the purpose of: Budgeting, risk analysis,
project planning and contr... | computer science |
35,723 | Control Neuronal por Modelo Inverso de un Servosistema Usando Algoritmos
de Aprendizaje Levenberg-Marquardt y Bayesiano | cs.AI | In this paper we present the experimental results of the neural network
control of a servo-system in order to control its speed. The control strategy
is implemented by using an inverse-model control based on Artificial Neural
Networks (ANNs). The network training was performed using two learning
algorithms: Levenberg-M... | computer science |
35,724 | Analytical and Learning-Based Spectrum Sensing Time Optimization in
Cognitive Radio Systems | cs.NI | Powerful spectrum sensing schemes enable cognitive radios (CRs) to find
transmission opportunities in spectral resources allocated exclusively to the
primary users. In this paper, maximizing the average throughput of a secondary
user by optimizing its spectrum sensing time is formulated assuming that a
prior knowledge ... | computer science |
35,725 | A Fuzzy Realistic Mobility Model For Ad hoc Networks | cs.AI | Realistic mobility models can demonstrate more precise evaluation results
because their parameters are closer to the reality. In this paper a realistic
Fuzzy Mobility Model has been proposed. This model has rules which is
changeable depending on nodes and environment conditions. This model is more
complete and precise ... | computer science |
35,726 | Understanding the Social Cascading of Geekspeak and the Upshots for
Social Cognitive Systems | cs.AI | Barring swarm robotics, a substantial share of current machine-human and
machine-machine learning and interaction mechanisms are being developed and fed
by results of agent-based computer simulations, game-theoretic models, or
robotic experiments based on a dyadic communication pattern. Yet, in real life,
humans no les... | computer science |
35,727 | Dynamics of Knowledge in DeLP through Argument Theory Change | cs.AI | This article is devoted to the study of methods to change defeasible logic
programs (de.l.p.s) which are the knowledge bases used by the Defeasible Logic
Programming (DeLP) interpreter. DeLP is an argumentation formalism that allows
to reason over potentially inconsistent de.l.p.s. Argument Theory Change (ATC)
studies ... | computer science |
35,728 | Task Interaction in an HTN Planner | cs.AI | Hierarchical Task Network (HTN) planning uses task decomposition to plan for
an executable sequence of actions as a solution to a problem. In order to
reason effectively, an HTN planner needs expressive domain knowledge. For
instance, a simplified HTN planning system such as JSHOP2 uses such
expressivity and avoids som... | computer science |
35,729 | Let us first agree on what the term "semantics" means: An unorthodox
approach to an age-old debate | cs.AI | Traditionally, semantics has been seen as a feature of human language. The
advent of the information era has led to its widespread redefinition as an
information feature. Contrary to this praxis, I define semantics as a special
kind of information. Revitalizing the ideas of Bar-Hillel and Carnap I have
recreated and re... | computer science |
35,730 | Technical Note: Exploring Σ^P_2 / Π^P_2-hardness for
Argumentation Problems with fixed distance to tractable classes | cs.AI | We study the complexity of reasoning in abstracts argumentation frameworks
close to graph classes that allow for efficient reasoning methods, i.e.\ to one
of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we
show that certain reasoning problems on the second level of the polynomial
hierarchy s... | computer science |
35,731 | Interactive Character Posing by Sparse Coding | cs.GR | Character posing is of interest in computer animation. It is difficult due to
its dependence on inverse kinematics (IK) techniques and articulate property of
human characters . To solve the IK problem, classical methods that rely on
numerical solutions often suffer from the under-determination problem and can
not guara... | computer science |
35,732 | Sentence based semantic similarity measure for blog-posts | cs.AI | Blogs-Online digital diary like application on web 2.0 has opened new and
easy way to voice opinion, thoughts, and like-dislike of every Internet user to
the World. Blogosphere has no doubt the largest user-generated content
repository full of knowledge. The potential of this knowledge is still to be
explored. Knowledg... | computer science |
35,733 | A Well-typed Lightweight Situation Calculus | cs.PL | Situation calculus has been widely applied in Artificial Intelligence related
fields. This formalism is considered as a dialect of logic programming language
and mostly used in dynamic domain modeling. However, type systems are hardly
deployed in situation calculus in the literature. To achieve a correct and
sound type... | computer science |
35,734 | Hybrid GPS-GSM Localization of Automobile Tracking System | cs.SY | An integrated GPS-GSM system is proposed to track vehicles using Google Earth
application. The remote module has a GPS mounted on the moving vehicle to
identify its current position, and to be transferred by GSM with other
parameters acquired by the automobile's data port as an SMS to a recipient
station. The received ... | computer science |
35,735 | A Dichotomy for 2-Constraint Forbidden CSP Patterns | cs.AI | Although the CSP (constraint satisfaction problem) is NP-complete, even in
the case when all constraints are binary, certain classes of instances are
tractable. We study classes of instances defined by excluding subproblems. This
approach has recently led to the discovery of novel tractable classes. The
complete charac... | computer science |
35,736 | A Description Logic Primer | cs.AI | This paper provides a self-contained first introduction to description logics
(DLs). The main concepts and features are explained with examples before syntax
and semantics of the DL SROIQ are defined in detail. Additional sections review
light-weight DL languages, discuss the relationship to the Web Ontology
Language O... | computer science |
35,737 | Collaborative Personalized Web Recommender System using Entropy based
Similarity Measure | cs.IR | On the internet, web surfers, in the search of information, always strive for
recommendations. The solutions for generating recommendations become more
difficult because of exponential increase in information domain day by day. In
this paper, we have calculated entropy based similarity between users to
achieve solution... | computer science |
35,738 | Memory Based Machine Intelligence Techniques in VLSI hardware | cs.AI | We briefly introduce the memory based approaches to emulate machine
intelligence in VLSI hardware, describing the challenges and advantages.
Implementation of artificial intelligence techniques in VLSI hardware is a
practical and difficult problem. Deep architectures, hierarchical temporal
memories and memory networks ... | computer science |
35,739 | Learning Performance of Prediction Markets with Kelly Bettors | cs.AI | In evaluating prediction markets (and other crowd-prediction mechanisms),
investigators have repeatedly observed a so-called "wisdom of crowds" effect,
which roughly says that the average of participants performs much better than
the average participant. The market price---an average or at least aggregate of
traders' b... | computer science |
35,740 | The Mind Grows Circuits | cs.AI | There is a vast supply of prior art that study models for mental processes.
Some studies in psychology and philosophy approach it from an inner perspective
in terms of experiences and percepts. Others such as neurobiology or
connectionist-machines approach it externally by viewing the mind as complex
circuit of neurons... | computer science |
35,741 | The Equational Approach to CF2 Semantics | cs.AI | We introduce a family of new equational semantics for argumentation networks
which can handle odd and even loops in a uniform manner. We offer one version
of equational semantics which is equivalent to CF2 semantics, and a better
version which gives the same results as traditional Dung semantics for even
loops but can ... | computer science |
35,742 | (Dual) Hoops Have Unique Halving | cs.AI | Continuous logic extends the multi-valued Lukasiewicz logic by adding a
halving operator on propositions. This extension is designed to give a more
satisfactory model theory for continuous structures. The semantics of these
logics can be given using specialisations of algebraic structures known as
hoops. As part of an ... | computer science |
35,743 | Contribution of Case Based Reasoning (CBR) in the Exploitation of Return
of Experience. Application to Accident Scenarii in Railroad Transport | cs.AI | The study is from a base of accident scenarii in rail transport (feedback) in
order to develop a tool to share build and sustain knowledge and safety and
secondly to exploit the knowledge stored to prevent the reproduction of
accidents / incidents. This tool should ultimately lead to the proposal of
prevention and prot... | computer science |
35,744 | Ambiguous Language and Differences in Beliefs | cs.AI | Standard models of multi-agent modal logic do not capture the fact that
information is often ambiguous, and may be interpreted in different ways by
different agents. We propose a framework that can model this, and consider
different semantics that capture different assumptions about the agents'
beliefs regarding whethe... | computer science |
35,745 | Modeling multistage decision processes with Reflexive Game Theory | cs.MA | This paper introduces application of Reflexive Game Theory to the matter of
multistage decision making processes. The idea behind is that each decision
making session has certain parameters like "when the session is taking place",
"who are the group members to make decision", "how group members influence on
each other"... | computer science |
35,746 | A Probabilistic Transmission Expansion Planning Methodology based on
Roulette Wheel Selection and Social Welfare | cs.AI | A new probabilistic methodology for transmission expansion planning (TEP)
that does not require a priori specification of new/additional transmission
capacities and uses the concept of social welfare has been proposed. Two new
concepts have been introduced in this paper: (i) roulette wheel methodology has
been used to ... | computer science |
35,747 | Playing games against nature: optimal policies for renewable resource
allocation | cs.AI | In this paper we introduce a class of Markov decision processes that arise as
a natural model for many renewable resource allocation problems. Upon extending
results from the inventory control literature, we prove that they admit a
closed form solution and we show how to exploit this structure to speed up its
computati... | computer science |
35,748 | Maximum likelihood fitting of acyclic directed mixed graphs to binary
data | stat.ME | Acyclic directed mixed graphs, also known as semi-Markov models represent the
conditional independence structure induced on an observed margin by a DAG model
with latent variables. In this paper we present the first method for fitting
these models to binary data using maximum likelihood estimation. | computer science |
35,749 | Learning Game Representations from Data Using Rationality Constraints | cs.GT | While game theory is widely used to model strategic interactions, a natural
question is where do the game representations come from? One answer is to learn
the representations from data. If one wants to learn both the payoffs and the
players' strategies, a naive approach is to learn them both directly from the
data. Th... | computer science |
35,750 | Intracluster Moves for Constrained Discrete-Space MCMC | stat.CO | This paper addresses the problem of sampling from binary distributions with
constraints. In particular, it proposes an MCMC method to draw samples from a
distribution of the set of all states at a specified distance from some
reference state. For example, when the reference state is the vector of zeros,
the algorithm c... | computer science |
35,751 | BEEM : Bucket Elimination with External Memory | cs.AI | A major limitation of exact inference algorithms for probabilistic graphical
models is their extensive memory usage, which often puts real-world problems
out of their reach. In this paper we show how we can extend inference
algorithms, particularly Bucket Elimination, a special case of cluster (join)
tree decomposition... | computer science |
35,752 | Automated Planning in Repeated Adversarial Games | cs.GT | Game theory's prescriptive power typically relies on full rationality and/or
self-play interactions. In contrast, this work sets aside these fundamental
premises and focuses instead on heterogeneous autonomous interactions between
two or more agents. Specifically, we introduce a new and concise representation
for repea... | computer science |
35,753 | The Cost of Troubleshooting Cost Clusters with Inside Information | cs.AI | Decision theoretical troubleshooting is about minimizing the expected cost of
solving a certain problem like repairing a complicated man-made device. In this
paper we consider situations where you have to take apart some of the device to
get access to certain clusters and actions. Specifically, we investigate
troublesh... | computer science |
35,754 | On a Class of Bias-Amplifying Variables that Endanger Effect Estimates | stat.ME | This note deals with a class of variables that, if conditioned on, tends to
amplify confounding bias in the analysis of causal effects. This class,
independently discovered by Bhattacharya and Vogt (2007) and Wooldridge (2009),
includes instrumental variables and variables that have greater influence on
treatment selec... | computer science |
35,755 | On Measurement Bias in Causal Inference | stat.ME | This paper addresses the problem of measurement errors in causal inference
and highlights several algebraic and graphical methods for eliminating
systematic bias induced by such errors. In particulars, the paper discusses the
control of partially observable confounders in parametric and non parametric
models and the co... | computer science |
35,756 | Confounding Equivalence in Causal Inference | stat.ME | The paper provides a simple test for deciding, from a given causal diagram,
whether two sets of variables have the same bias-reducing potential under
adjustment. The test requires that one of the following two conditions holds:
either (1) both sets are admissible (i.e., satisfy the back-door criterion) or
(2) the Marko... | computer science |
35,757 | On the Validity of Covariate Adjustment for Estimating Causal Effects | stat.ME | Identifying effects of actions (treatments) on outcome variables from
observational data and causal assumptions is a fundamental problem in causal
inference. This identification is made difficult by the presence of confounders
which can be related to both treatment and outcome variables. Confounders are
often handled, ... | computer science |
35,758 | Truthful Feedback for Sanctioning Reputation Mechanisms | cs.GT | For product rating environments, similar to that of Amazon Reviews, it has
been shown that the truthful elicitation of feedback is possible through
mechanisms which pay buyer reports contingent on the reports of other buyers.
We study whether similar mechanisms can be designed for reputation mechanisms
at online auctio... | computer science |
35,759 | Multi-Domain Collaborative Filtering | cs.IR | Collaborative filtering is an effective recommendation approach in which the
preference of a user on an item is predicted based on the preferences of other
users with similar interests. A big challenge in using collaborative filtering
methods is the data sparsity problem which often arises because each user
typically o... | computer science |
35,760 | The Abzooba Smart Health Informatics Platform (SHIP) TM - From Patient
Experiences to Big Data to Insights | cs.IR | This paper describes a technology to connect patients to information in the
experiences of other patients by using the power of structured big data. The
approach, implemented in the Abzooba Smart Health Informatics Platform
(SHIP),is to distill concepts of facts and expressions from conversations and
discussions in hea... | computer science |
35,761 | The Initial Conditions of the Universe from Constrained Simulations | cs.AI | I present a new approach to recover the primordial density fluctuations and
the cosmic web structure underlying a galaxy distribution. The method is based
on sampling Gaussian fields which are compatible with a galaxy distribution and
a structure formation model. This is achieved by splitting the inversion
problem into... | computer science |
35,762 | Global preferential consistency for the topological sorting-based
maximal spanning tree problem | cs.AI | We introduce a new type of fully computable problems, for DSS dedicated to
maximal spanning tree problems, based on deduction and choice: preferential
consistency problems. To show its interest, we describe a new compact
representation of preferences specific to spanning trees, identifying an
efficient maximal spanning... | computer science |
35,763 | Learning from Humans as an I-POMDP | cs.RO | The interactive partially observable Markov decision process (I-POMDP) is a
recently developed framework which extends the POMDP to the multi-agent setting
by including agent models in the state space. This paper argues for formulating
the problem of an agent learning interactively from a human teacher as an
I-POMDP, w... | computer science |
35,764 | A collaborative ant colony metaheuristic for distributed multi-level
lot-sizing | cs.AI | The paper presents an ant colony optimization metaheuristic for collaborative
planning. Collaborative planning is used to coordinate individual plans of
self-interested decision makers with private information in order to increase
the overall benefit of the coalition. The method consists of a new search graph
based on ... | computer science |
35,765 | How Many Vote Operations Are Needed to Manipulate A Voting System? | cs.AI | In this paper, we propose a framework to study a general class of strategic
behavior in voting, which we call vote operations. We prove the following
theorem: if we fix the number of alternatives, generate $n$ votes i.i.d.
according to a distribution $\pi$, and let $n$ go to infinity, then for any
$\epsilon >0$, with p... | computer science |
35,766 | A new approach of designing Multi-Agent Systems | cs.MA | Agent technology is a software paradigm that permits to implement large and
complex distributed applications. In order to assist analyzing, conception and
development or implementation phases of multi-agent systems, we've tried to
present a practical application of a generic and scalable method of a MAS with
a componen... | computer science |
35,767 | An Intelligent Location Management approaches in GSM Mobile Network | cs.NI | Location management refers to the problem of updating and searching the
current location of mobile nodes in a wireless network. To make it efficient,
the sum of update costs of location database must be minimized. Previous work
relying on fixed location databases is unable to fully exploit the knowledge of
user mobilit... | computer science |
35,768 | Automated Feedback Generation for Introductory Programming Assignments | cs.PL | We present a new method for automatically providing feedback for introductory
programming problems. In order to use this method, we need a reference
implementation of the assignment, and an error model consisting of potential
corrections to errors that students might make. Using this information, the
system automatical... | computer science |
35,769 | Robust Spatio-Temporal Signal Recovery from Noisy Counts in Social Media | cs.AI | Many real-world phenomena can be represented by a spatio-temporal signal:
where, when, and how much. Social media is a tantalizing data source for those
who wish to monitor such signals. Unlike most prior work, we assume that the
target phenomenon is known and we are given a method to count its occurrences
in social me... | computer science |
35,770 | Symmetry Breaking Constraints: Recent Results | cs.AI | Symmetry is an important problem in many combinatorial problems. One way of
dealing with symmetry is to add constraints that eliminate symmetric solutions.
We survey recent results in this area, focusing especially on two common and
useful cases: symmetry breaking constraints for row and column symmetry, and
symmetry b... | computer science |
35,771 | When majority voting fails: Comparing quality assurance methods for
noisy human computation environment | cs.SI | Quality assurance remains a key topic in human computation research. Prior
work indicates that majority voting is effective for low difficulty tasks, but
has limitations for harder tasks. This paper explores two methods of addressing
this problem: tournament selection and elimination selection, which exploit 2-,
3- and... | computer science |
35,772 | Hardness Results for Approximate Pure Horn CNF Formulae Minimization | cs.CC | We study the hardness of approximation of clause minimum and literal minimum
representations of pure Horn functions in $n$ Boolean variables. We show that
unless P=NP, it is not possible to approximate in polynomial time the minimum
number of clauses and the minimum number of literals of pure Horn CNF
representations t... | computer science |
35,773 | Analysis of a Natural Gradient Algorithm on Monotonic
Convex-Quadratic-Composite Functions | cs.AI | In this paper we investigate the convergence properties of a variant of the
Covariance Matrix Adaptation Evolution Strategy (CMA-ES). Our study is based on
the recent theoretical foundation that the pure rank-mu update CMA-ES performs
the natural gradient descent on the parameter space of Gaussian distributions.
We der... | computer science |
35,774 | Avian Influenza (H5N1) Warning System using Dempster-Shafer Theory and
Web Mapping | cs.AI | Based on Cumulative Number of Confirmed Human Cases of Avian Influenza (H5N1)
Reported to World Health Organization (WHO) in the 2011 from 15 countries,
Indonesia has the largest number death because Avian Influenza which 146
deaths. In this research, the researcher built a Web Mapping and
Dempster-Shafer theory as ear... | computer science |
35,775 | Avian Influenza (H5N1) Expert System using Dempster-Shafer Theory | cs.AI | Based on Cumulative Number of Confirmed Human Cases of Avian Influenza (H5N1)
Reported to World Health Organization (WHO) in the 2011 from 15 countries,
Indonesia has the largest number death because Avian Influenza which 146
deaths. In this research, the researcher built an Avian Influenza (H5N1) Expert
System for ide... | computer science |
35,776 | What's in an `is about' link? Chemical diagrams and the Information
Artifact Ontology | cs.AI | The Information Artifact Ontology is an ontology in the domain of information
entities. Core to the definition of what it is to be an information entity is
the claim that an information entity must be `about' something, which is
encoded in an axiom expressing that all information entities are about some
entity. This ax... | computer science |
35,777 | Transmission of distress in a bank credit network | cs.AI | The European sovereign debt crisis has impaired many European banks. The
distress on the European banks may transmit worldwide, and result in a
large-scale knock-on default of financial institutions. This study presents a
computer simulation model to analyze the risk of insolvency of banks and
defaults in a bank credit... | computer science |
35,778 | Intelligent Automated Diagnosis of Client Device Bottlenecks in Private
Clouds | cs.NI | We present an automated solution for rapid diagnosis of client device
problems in private cloud environments: the Intelligent Automated Client
Diagnostic (IACD) system. Clients are diagnosed with the aid of Transmission
Control Protocol (TCP) packet traces, by (i) observation of anomalous artifacts
occurring as a resul... | computer science |
35,779 | On the Complexity of Finding Second-Best Abductive Explanations | cs.LO | While looking for abductive explanations of a given set of manifestations, an
ordering between possible solutions is often assumed. The complexity of
finding/verifying optimal solutions is already known. In this paper we consider
the computational complexity of finding second-best solutions. We consider
different order... | computer science |
35,780 | Quantified Conditional Logics are Fragments of HOL | cs.AI | A semantic embedding of (constant domain) quantified conditional logic in
classical higher-order logic is presented. | computer science |
35,781 | Containment, Equivalence and Coreness from CSP to QCSP and beyond | cs.LO | The constraint satisfaction problem (CSP) and its quantified extensions,
whether without (QCSP) or with disjunction (QCSP_or), correspond naturally to
the model checking problem for three increasingly stronger fragments of
positive first-order logic. Their complexity is often studied when
parameterised by a fixed model... | computer science |
35,782 | Magic Sets for Disjunctive Datalog Programs | cs.AI | In this paper, a new technique for the optimization of (partially) bound
queries over disjunctive Datalog programs with stratified negation is
presented. The technique exploits the propagation of query bindings and extends
the Magic Set (MS) optimization technique.
An important feature of disjunctive Datalog is nonmo... | computer science |
35,783 | Generalising unit-refutation completeness and SLUR via nested input
resolution | cs.LO | We introduce two hierarchies of clause-sets, SLUR_k and UC_k, based on the
classes SLUR (Single Lookahead Unit Refutation), introduced in 1995, and UC
(Unit refutation Complete), introduced in 1994.
The class SLUR, introduced in [Annexstein et al, 1995], is the class of
clause-sets for which unit-clause-propagation (... | computer science |
35,784 | System identification and modeling for interacting and non-interacting
tank systems using intelligent techniques | cs.AI | System identification from the experimental data plays a vital role for model
based controller design. Derivation of process model from first principles is
often difficult due to its complexity. The first stage in the development of
any control and monitoring system is the identification and modeling of the
system. Eac... | computer science |
35,785 | Credal nets under epistemic irrelevance | cs.AI | We present a new approach to credal nets, which are graphical models that
generalise Bayesian nets to imprecise probability. Instead of applying the
commonly used notion of strong independence, we replace it by the weaker notion
of epistemic irrelevance. We show how assessments of epistemic irrelevance
allow us to cons... | computer science |
35,786 | Payment Rules through Discriminant-Based Classifiers | cs.GT | In mechanism design it is typical to impose incentive compatibility and then
derive an optimal mechanism subject to this constraint. By replacing the
incentive compatibility requirement with the goal of minimizing expected ex
post regret, we are able to adapt statistical machine learning techniques to
the design of pay... | computer science |
35,787 | Toward an Integrated Framework for Automated Development and
Optimization of Online Advertising Campaigns | cs.IR | Creating and monitoring competitive and cost-effective pay-per-click
advertisement campaigns through the web-search channel is a resource demanding
task in terms of expertise and effort. Assisting or even automating the work of
an advertising specialist will have an unrivaled commercial value. In this
paper we propose ... | computer science |
35,788 | A Dynamic Phase Selection Strategy for Satisfiability Solvers | cs.LO | The phase selection is an important of a SAT Solver based on conflict-driven
DPLL. This paper presents a new phase selection strategy, in which the weight
of each literal is defined as the sum of its implied-literals static weights.
The implied literals of each literal is computed dynamically during the search.
Therefo... | computer science |
35,789 | Guidelines for a Dynamic Ontology - Integrating Tools of Evolution and
Versioning in Ontology | cs.SE | Ontologies are built on systems that conceptually evolve over time. In
addition, techniques and languages for building ontologies evolve too. This has
led to numerous studies in the field of ontology versioning and ontology
evolution. This paper presents a new way to manage the lifecycle of an ontology
incorporating bo... | computer science |
35,790 | Algorithmic Simplicity and Relevance | cs.AI | The human mind is known to be sensitive to complexity. For instance, the
visual system reconstructs hidden parts of objects following a principle of
maximum simplicity. We suggest here that higher cognitive processes, such as
the selection of relevant situations, are sensitive to variations of
complexity. Situations ar... | computer science |
35,791 | Experiments with Game Tree Search in Real-Time Strategy Games | cs.AI | Game tree search algorithms such as minimax have been used with enormous
success in turn-based adversarial games such as Chess or Checkers. However,
such algorithms cannot be directly applied to real-time strategy (RTS) games
because a number of reasons. For example, minimax assumes a turn-taking game
mechanics, not pr... | computer science |
35,792 | Analysis of Statistical Hypothesis based Learning Mechanism for Faster
Crawling | cs.IR | The growth of world-wide-web (WWW) spreads its wings from an intangible
quantities of web-pages to a gigantic hub of web information which gradually
increases the complexity of crawling process in a search engine. A search
engine handles a lot of queries from various parts of this world, and the
answers of it solely de... | computer science |
35,793 | The Guppy Effect as Interference | cs.AI | People use conjunctions and disjunctions of concepts in ways that violate the
rules of classical logic, such as the law of compositionality. Specifically,
they overextend conjunctions of concepts, a phenomenon referred to as the Guppy
Effect. We build on previous efforts to develop a quantum model that explains
the Gup... | computer science |
35,794 | Ordered {AND, OR}-Decomposition and Binary-Decision Diagram | cs.AI | In the context of knowledge compilation (KC), we study the effect of
augmenting Ordered Binary Decision Diagrams (OBDD) with two kinds of
decomposition nodes, i.e., AND-vertices and OR-vertices which denote
conjunctive and disjunctive decomposition of propositional knowledge bases,
respectively. The resulting knowledge... | computer science |
35,795 | A Novel Strategy Selection Method for Multi-Objective Clustering
Algorithms Using Game Theory | cs.GT | The most important factors which contribute to the efficiency of
game-theoretical algorithms are time and game complexity. In this study, we
have offered an elegant method to deal with high complexity of game theoretic
multi-objective clustering methods in large-sized data sets. Here, we have
developed a method which s... | computer science |
35,796 | Content-based Text Categorization using Wikitology | cs.IR | A major computational burden, while performing document clustering, is the
calculation of similarity measure between a pair of documents. Similarity
measure is a function that assign a real number between 0 and 1 to a pair of
documents, depending upon the degree of similarity between them. A value of
zero means that th... | computer science |
35,797 | Monte Carlo Search Algorithm Discovery for One Player Games | cs.AI | Much current research in AI and games is being devoted to Monte Carlo search
(MCS) algorithms. While the quest for a single unified MCS algorithm that would
perform well on all problems is of major interest for AI, practitioners often
know in advance the problem they want to solve, and spend plenty of time
exploiting t... | computer science |
35,798 | Document Clustering Evaluation: Divergence from a Random Baseline | cs.IR | Divergence from a random baseline is a technique for the evaluation of
document clustering. It ensures cluster quality measures are performing work
that prevents ineffective clusterings from giving high scores to clusterings
that provide no useful result. These concepts are defined and analysed using
intrinsic and extr... | computer science |
35,799 | Optimizing Supply Chain Management using Gravitational Search Algorithm
and Multi Agent System | cs.MA | Supply chain management is a very dynamic operation research problem where
one has to quickly adapt according to the changes perceived in environment in
order to maximize the benefit or minimize the loss. Therefore we require a
system which changes as per the changing requirements. Multi agent system
technology in rece... | computer science |
35,800 | Theorem Proving in Large Formal Mathematics as an Emerging AI Field | cs.AI | In the recent years, we have linked a large corpus of formal mathematics with
automated theorem proving (ATP) tools, and started to develop combined AI/ATP
systems working in this setting. In this paper we first relate this project to
the earlier large-scale automated developments done by Quaife with McCune's
Otter sys... | computer science |
35,801 | Modeling and Verification of a Multi-Agent Argumentation System using
NuSMV | cs.AI | Autonomous intelligent agent research is a domain situated at the forefront
of artificial intelligence. Interest-based negotiation (IBN) is a form of
negotiation in which agents exchange information about their underlying goals,
with a view to improve the likelihood and quality of a offer. In this paper we
model and ve... | computer science |
35,802 | Parametric matroid of rough set | cs.AI | Rough set is mainly concerned with the approximations of objects through an
equivalence relation on a universe. Matroid is a combinatorial generalization
of linear independence in vector spaces. In this paper, we define a parametric
set family, with any subset of a universe as its parameter, to connect rough
sets and m... | computer science |
35,803 | Mining Social Data to Extract Intellectual Knowledge | cs.AI | Social data mining is an interesting phe-nomenon which colligates different
sources of social data to extract information. This information can be used in
relationship prediction, decision making, pat-tern recognition, social mapping,
responsibility distri-bution and many other applications. This paper presents a
syste... | computer science |
35,804 | A Cookbook for Temporal Conceptual Data Modelling with Description
Logics | cs.LO | We design temporal description logics suitable for reasoning about temporal
conceptual data models and investigate their computational complexity. Our
formalisms are based on DL-Lite logics with three types of concept inclusions
(ranging from atomic concept inclusions and disjointness to the full Booleans),
as well as ... | computer science |
35,805 | Extension du formalisme des flux opérationnels par une algèbre
temporelle | cs.AI | Workflows constitute an important language to represent knowledge about
processes, but also increasingly to reason on such knowledge. On the other
hand, there is a limit to which time constraints between activities can be
expressed. Qualitative interval algebras can model processes using finer
temporal relations, but t... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.