Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,104 | The Case for Learned Index Structures | cs.DB | Indexes are models: a B-Tree-Index can be seen as a model to map a key to the
position of a record within a sorted array, a Hash-Index as a model to map a
key to a position of a record within an unsorted array, and a BitMap-Index as a
model to indicate if a data record exists or not. In this exploratory research
paper,... | computer science |
35,105 | Artificial intelligence in peer review: How can evolutionary computation
support journal editors? | cs.DL | With the volume of manuscripts submitted for publication growing every year,
the deficiencies of peer review (e.g. long review times) are becoming more
apparent. Editorial strategies, sets of guidelines designed to speed up the
process and reduce editors workloads, are treated as trade secrets by
publishing houses and ... | computer science |
35,106 | Chaos-guided Input Structuring for Improved Learning in Recurrent Neural
Networks | cs.NE | Anatomical studies demonstrate that brain reformats input information to
generate reliable responses for performing computations. However, it remains
unclear how neural circuits encode complex spatio-temporal patterns. We show
that neural dynamics are strongly influenced by the phase alignment between the
input and the... | computer science |
35,107 | DeepIso: A Deep Learning Model for Peptide Feature Detection | cs.NE | Liquid chromatography with tandem mass spectrometry (LC-MS/MS) based
proteomics is a well-established research field with major applications such as
identification of disease biomarkers, drug discovery, drug design and
development. In proteomics, protein identification and quantification is a
fundamental task, which is... | computer science |
35,108 | Spiking memristor logic gates are a type of time-variant perceptron | cs.ET | Memristors are low-power memory-holding resistors thought to be useful for
neuromophic computing, which can compute via spike-interactions mediated
through the device's short-term memory. Using interacting spikes, it is
possible to build an AND gate that computes OR at the same time, similarly a
full adder can be built... | computer science |
35,109 | Near Maximum Likelihood Decoding with Deep Learning | cs.IT | A novel and efficient neural decoder algorithm is proposed. The proposed
decoder is based on the neural Belief Propagation algorithm and the
Automorphism Group. By combining neural belief propagation with permutations
from the Automorphism Group we achieve near maximum likelihood performance for
High Density Parity Che... | computer science |
35,110 | Probabilistic Tools for the Analysis of Randomized Optimization
Heuristics | cs.DS | This chapter collects several probabilistic tools that proved to be useful in
the analysis of randomized search heuristics. This includes classic material
like Markov, Chebyshev and Chernoff inequalities, but also lesser known topics
like stochastic domination and coupling or Chernoff bounds for geometrically
distribut... | computer science |
35,111 | Lie Transform Based Polynomial Neural Networks for Dynamical Systems
Simulation and Identification | cs.NE | In the article, we discuss the architecture of the polynomial neural network
that corresponds to the matrix representation of Lie transform. The matrix form
of Lie transform is an approximation of general solution for the nonlinear
system of ordinary differential equations. Thus, it can be used for simulation
and model... | computer science |
35,112 | One Deep Music Representation to Rule Them All? : A comparative analysis
of different representation learning strategies | cs.NE | Inspired by the success of deploying deep learning in the fields of Computer
Vision and Natural Language Processing, this learning paradigm has also found
its way into the field of Music Information Retrieval. In order to benefit from
deep learning in an effective, but also efficient manner, deep transfer
learning has ... | computer science |
35,113 | Advancing System Performance with Redundancy: From Biological to
Artificial Designs | cs.IT | Redundancy is a fundamental characteristic of many biological processes such
as those in the genetic, visual, muscular and nervous system; yet its function
has not been fully understood. The conventional interpretation of redundancy is
that it serves as a fault-tolerance mechanism, which leads to redundancy's de
facto ... | computer science |
35,114 | A Bio-inspired Redundant Sensing Architecture | cs.NE | Sensing is the process of deriving signals from the environment that allows
artificial systems to interact with the physical world. The Shannon theorem
specifies the maximum rate at which information can be acquired. However, this
upper bound is hard to achieve in many man-made systems. The biological visual
systems, o... | computer science |
35,115 | Memcomputing: Leveraging memory and physics to compute efficiently | cs.ET | It is well known that physical phenomena may be of great help in computing
some difficult problems efficiently. A typical example is prime factorization
that may be solved in polynomial time by exploiting quantum entanglement on a
quantum computer. There are, however, other types of (non-quantum) physical
properties th... | computer science |
35,116 | Limits on representing Boolean functions by linear combinations of
simple functions: thresholds, ReLUs, and low-degree polynomials | cs.CC | We consider the problem of representing Boolean functions exactly by "sparse"
linear combinations (over $\mathbb{R}$) of functions from some "simple" class
${\cal C}$. In particular, given ${\cal C}$ we are interested in finding
low-complexity functions lacking sparse representations. When ${\cal C}$ is the
set of PARI... | computer science |
35,117 | Neuron inspired data encoding memristive multi-level memory cell | cs.ET | Mapping neuro-inspired algorithms to sensor backplanes of on-chip hardware
require shifting the signal processing from digital to the analog domain,
demanding memory technologies beyond conventional CMOS binary storage units.
Using memristors for building analog data storage is one of the promising
approaches amongst e... | computer science |
35,118 | Analog simulator of integro-differential equations with classical
memristors | cs.ET | An analog computer makes use of continuously changeable quantities of a
system, such as its electrical, mechanical, or hydraulic properties, to solve a
given problem. While these devices are usually computationally more powerful
than their digital counterparts, they suffer from analog noise which does not
allow to erro... | computer science |
35,119 | Glyph: Symbolic Regression Tools | cs.MS | We present Glyph - a Python package for genetic programming based symbolic
regression. Glyph is designed for usage let by numerical simulations let by
real world experiments. For experimentalists, glyph-remote provides a
separation of tasks: a ZeroMQ interface splits the genetic programming
optimization task from the e... | computer science |
35,120 | Information content of coevolutionary game landscapes | cs.NE | Coevolutionary game dynamics is the result of players that may change their
strategies and their network of interaction. For such games, and based on
interpreting strategies as configurations, strategy-to-payoff maps can be
defined for every interaction network, which opens up to derive game
landscapes. This paper pres... | computer science |
35,121 | Relaxation in graph coloring and satisfiability problems | cs.AI | Using T=0 Monte Carlo simulation, we study the relaxation of graph coloring
(K-COL) and satisfiability (K-SAT), two hard problems that have recently been
shown to possess a phase transition in solvability as a parameter is varied. A
change from exponentially fast to power law relaxation, and a transition to
freezing be... | computer science |
35,122 | On the Informativeness of the DNA Promoter Sequences Domain Theory | cs.AI | The DNA promoter sequences domain theory and database have become popular for
testing systems that integrate empirical and analytical learning. This note
reports a simple change and reinterpretation of the domain theory in terms of
M-of-N concepts, involving no learning, that results in an accuracy of 93.4% on
the 106 ... | computer science |
35,123 | Analysis of Three-Dimensional Protein Images | cs.AI | A fundamental goal of research in molecular biology is to understand protein
structure. Protein crystallography is currently the most successful method for
determining the three-dimensional (3D) conformation of a protein, yet it
remains labor intensive and relies on an expert's ability to derive and
evaluate a protein ... | computer science |
35,124 | Chess Pure Strategies are Probably Chaotic | cs.CC | It is odd that chess grandmasters often disagree in their analysis of
positions, sometimes even of simple ones, and that a grandmaster can hold his
own against an powerful analytic machine such as Deep Blue. The fact that there
must exist pure winning strategies for chess is used to construct a control
strategy functio... | computer science |
35,125 | First-Order Conditional Logic Revisited | cs.AI | Conditional logics play an important role in recent attempts to formulate
theories of default reasoning. This paper investigates first-order conditional
logic. We show that, as for first-order probabilistic logic, it is important
not to confound statistical conditionals over the domain (such as ``most birds
fly''), and... | computer science |
35,126 | Set-Theoretic Completeness for Epistemic and Conditional Logic | cs.AI | The standard approach to logic in the literature in philosophy and
mathematics, which has also been adopted in computer science, is to define a
language (the syntax), an appropriate class of models together with an
interpretation of formulas in the language (the semantics), a collection of
axioms and rules of inference... | computer science |
35,127 | Plausibility Measures and Default Reasoning | cs.AI | We introduce a new approach to modeling uncertainty based on plausibility
measures. This approach is easily seen to generalize other approaches to
modeling uncertainty, such as probability measures, belief functions, and
possibility measures. We focus on one application of plausibility measures in
this paper: default r... | computer science |
35,128 | Reasoning about Noisy Sensors and Effectors in the Situation Calculus | cs.AI | Agents interacting with an incompletely known world need to be able to reason
about the effects of their actions, and to gain further information about that
world they need to use sensors of some sort. Unfortunately, both the effects of
actions and the information returned from sensors are subject to error. To cope
wit... | computer science |
35,129 | Stable models and an alternative logic programming paradigm | cs.LO | In this paper we reexamine the place and role of stable model semantics in
logic programming and contrast it with a least Herbrand model approach to Horn
programs. We demonstrate that inherent features of stable model semantics
naturally lead to a logic programming system that offers an interesting
alternative to more ... | computer science |
35,130 | Semantics and Conversations for an Agent Communication Language | cs.MA | We address the issues of semantics and conversations for agent communication
languages and the Knowledge Query Manipulation Language (KQML) in particular.
Based on ideas from speech act theory, we present a semantic description for
KQML that associates ``cognitive'' states of the agent with the use of the
language's pr... | computer science |
35,131 | Learning Nested Agent Models in an Information Economy | cs.MA | We present our approach to the problem of how an agent, within an economic
Multi-Agent System, can determine when it should behave strategically (i.e.
learn and use models of other agents), and when it should act as a simple
price-taker. We provide a framework for the incremental implementation of
modeling capabilities... | computer science |
35,132 | Using Local Optimality Criteria for Efficient Information Retrieval with
Redundant Information Filters | cs.IR | We consider information retrieval when the data, for instance multimedia, is
coputationally expensive to fetch. Our approach uses "information filters" to
considerably narrow the universe of possiblities before retrieval. We are
especially interested in redundant information filters that save time over more
general but... | computer science |
35,133 | Anytime Coalition Structure Generation with Worst Case Guarantees | cs.MA | Coalition formation is a key topic in multiagent systems. One would prefer a
coalition structure that maximizes the sum of the values of the coalitions, but
often the number of coalition structures is too large to allow exhaustive
search for the optimal one. But then, can the coalition structure found via a
partial sea... | computer science |
35,134 | A Proof Theoretic View of Constraint Programming | cs.AI | We provide here a proof theoretic account of constraint programming that
attempts to capture the essential ingredients of this programming style. We
exemplify it by presenting proof rules for linear constraints over interval
domains, and illustrate their use by analyzing the constraint propagation
process for the {\tt ... | computer science |
35,135 | A Human - machine interface for teleoperation of arm manipulators in a
complex environment | cs.RO | This paper discusses the feasibility of using configuration space (C-space)
as a means of visualization and control in operator-guided real-time motion of
a robot arm manipulator. The motivation is to improve performance of the human
operator in tasks involving the manipulator motion in an environment with
obstacles. U... | computer science |
35,136 | Hypertree Decompositions and Tractable Queries | cs.DB | Several important decision problems on conjunctive queries (CQs) are
NP-complete in general but become tractable, and actually highly
parallelizable, if restricted to acyclic or nearly acyclic queries. Examples
are the evaluation of Boolean CQs and query containment. These problems were
shown tractable for conjunctive ... | computer science |
35,137 | Fixpoint 3-valued semantics for autoepistemic logic | cs.LO | The paper presents a constructive fixpoint semantics for autoepistemic logic
(AEL). This fixpoint characterizes a unique but possibly three-valued belief
set of an autoepistemic theory. It may be three-valued in the sense that for a
subclass of formulas F, the fixpoint may not specify whether F is believed or
not. The ... | computer science |
35,138 | Extremal problems in logic programming and stable model computation | cs.LO | We study the following problem: given a class of logic programs C, determine
the maximum number of stable models of a program from C. We establish the
maximum for the class of all logic programs with at most n clauses, and for the
class of all logic programs of size at most n. We also characterize the
programs for whic... | computer science |
35,139 | Representation Theory for Default Logic | cs.LO | Default logic can be regarded as a mechanism to represent families of belief
sets of a reasoning agent. As such, it is inherently second-order. In this
paper, we study the problem of representability of a family of theories as the
set of extensions of a default theory. We give a complete solution to the
representabilit... | computer science |
35,140 | Predicate Logic with Definitions | cs.LO | Predicate Logic with Definitions (PLD or D-logic) is a modification of
first-order logic intended mostly for practical formalization of mathematics.
The main syntactic constructs of D-logic are terms, formulas and definitions. A
definition is a definition of variables, a definition of constants, or a
composite definiti... | computer science |
35,141 | Clausal Temporal Resolution | cs.LO | In this article, we examine how clausal resolution can be applied to a
specific, but widely used, non-classical logic, namely discrete linear temporal
logic. Thus, we first define a normal form for temporal formulae and show how
arbitrary temporal formulae can be translated into the normal form, while
preserving satisf... | computer science |
35,142 | Extending the Stable Model Semantics with More Expressive Rules | cs.LO | The rules associated with propositional logic programs and the stable model
semantics are not expressive enough to let one write concise programs. This
problem is alleviated by introducing some new types of propositional rules.
Together with a decision procedure that has been used as a base for an
efficient implementat... | computer science |
35,143 | The Rough Guide to Constraint Propagation | cs.AI | We provide here a simple, yet very general framework that allows us to
explain several constraint propagation algorithms in a systematic way. In
particular, using the notions commutativity and semi-commutativity, we show how
the well-known AC-3, PC-2, DAC and DPC algorithms are instances of a single
generic algorithm. ... | computer science |
35,144 | Automatic Generation of Constraint Propagation Algorithms for Small
Finite Domains | cs.AI | We study here constraint satisfaction problems that are based on predefined,
explicitly given finite constraints. To solve them we propose a notion of rule
consistency that can be expressed in terms of rules derived from the explicit
representation of the initial constraints.
This notion of local consistency is weake... | computer science |
35,145 | Reasoning About Common Knowledge with Infinitely Many Agents | cs.LO | Complete axiomatizations and exponential-time decision procedures are
provided for reasoning about knowledge and common knowledge when there are
infinitely many agents. The results show that reasoning about knowledge and
common knowledge with infinitely many agents is no harder than when there are
finitely many agents,... | computer science |
35,146 | Knowledge in Multi-Agent Systems: Initial Configurations and Broadcast | cs.LO | The semantic framework for the modal logic of knowledge due to Halpern and
Moses provides a way to ascribe knowledge to agents in distributed and
multi-agent systems. In this paper we study two special cases of this
framework: full systems and hypercubes. Both model static situations in which
no agent has any informati... | computer science |
35,147 | PIPE: Personalizing Recommendations via Partial Evaluation | cs.IR | It is shown that personalization of web content can be advantageously viewed
as a form of partial evaluation --- a technique well known in the programming
languages community. The basic idea is to model a recommendation space as a
program, then partially evaluate this program with respect to user preferences
(and featu... | computer science |
35,148 | Multi-Agent Only Knowing | cs.AI | Levesque introduced a notion of ``only knowing'', with the goal of capturing
certain types of nonmonotonic reasoning. Levesque's logic dealt with only the
case of a single agent. Recently, both Halpern and Lakemeyer independently
attempted to extend Levesque's logic to the multi-agent case. Although there
are a number ... | computer science |
35,149 | Computing large and small stable models | cs.LO | In this paper, we focus on the problem of existence and computing of small
and large stable models. We show that for every fixed integer k, there is a
linear-time algorithm to decide the problem LSM (large stable models problem):
does a logic program P have a stable model of size at least |P|-k. In contrast,
we show th... | computer science |
35,150 | Safe cooperative robot dynamics on graphs | cs.RO | This paper initiates the use of vector fields to design, optimize, and
implement reactive schedules for safe cooperative robot patterns on planar
graphs. We consider Automated Guided Vehicles (AGV's) operating upon a
predefined network of pathways. In contrast to the case of locally Euclidean
configuration spaces, regu... | computer science |
35,151 | Genetic Algorithms for Extension Search in Default Logic | cs.AI | A default theory can be characterized by its sets of plausible conclusions,
called its extensions. But, due to the theoretical complexity of Default Logic
(Sigma_2p-complete), the problem of finding such an extension is very difficult
if one wants to deal with non trivial knowledge bases. Based on the principle
of natu... | computer science |
35,152 | SLT-Resolution for the Well-Founded Semantics | cs.AI | Global SLS-resolution and SLG-resolution are two representative mechanisms
for top-down evaluation of the well-founded semantics of general logic
programs. Global SLS-resolution is linear for query evaluation but suffers from
infinite loops and redundant computations. In contrast, SLG-resolution resolves
infinite loops... | computer science |
35,153 | Computing Circumscriptive Databases by Integer Programming: Revisited
(Extended Abstract) | cs.AI | In this paper, we consider a method of computing minimal models in
circumscription using integer programming in propositional logic and
first-order logic with domain closure axioms and unique name axioms. This kind
of treatment is very important since this enable to apply various technique
developed in operations resea... | computer science |
35,154 | Conditional indifference and conditional preservation | cs.AI | The idea of preserving conditional beliefs emerged recently as a new paradigm
apt to guide the revision of epistemic states. Conditionals are substantially
different from propositional beliefs and need specific treatment. In this
paper, we present a new approach to conditionals, capturing particularly well
their dynami... | computer science |
35,155 | Automatic Belief Revision in SNePS | cs.AI | SNePS is a logic- and network- based knowledge representation, reasoning, and
acting system, based on a monotonic, paraconsistent, first-order term logic,
with compositional intensional semantics. It has an ATMS-style facility for
belief contraction, and an acting component, including a well-defined syntax
and semantic... | computer science |
35,156 | A flexible framework for defeasible logics | cs.AI | Logics for knowledge representation suffer from over-specialization: while
each logic may provide an ideal representation formalism for some problems, it
is less than optimal for others. A solution to this problem is to choose from
several logics and, when necessary, combine the representations. In general,
such an app... | computer science |
35,157 | Applying Maxi-adjustment to Adaptive Information Filtering Agents | cs.AI | Learning and adaptation is a fundamental property of intelligent agents. In
the context of adaptive information filtering, a filtering agent's beliefs
about a user's information needs have to be revised regularly with reference to
the user's most current information preferences. This learning and adaptation
process is ... | computer science |
35,158 | On the semantics of merging | cs.AI | Intelligent agents are often faced with the problem of trying to merge
possibly conflicting pieces of information obtained from different sources into
a consistent view of the world. We propose a framework for the modelling of
such merging operations with roots in the work of Spohn (1988, 1991). Unlike
most approaches ... | computer science |
35,159 | The lexicographic closure as a revision process | cs.AI | The connections between nonmonotonic reasoning and belief revision are
well-known. A central problem in the area of nonmonotonic reasoning is the
problem of default entailment, i.e., when should an item of default information
representing "if A is true then, normally, B is true" be said to follow from a
given set of it... | computer science |
35,160 | Description of GADEL | cs.AI | This article describes the first implementation of the GADEL system : a
Genetic Algorithm for Default Logic. The goal of GADEL is to compute extensions
in Reiter's default logic. It accepts every kind of finite propositional
default theories and is based on evolutionary principles of Genetic Algorithms.
Its first exper... | computer science |
35,161 | Extending Classical Logic with Inductive Definitions | cs.LO | The goal of this paper is to extend classical logic with a generalized notion
of inductive definition supporting positive and negative induction, to
investigate the properties of this logic, its relationships to other logics in
the area of non-monotonic reasoning, logic programming and deductive databases,
and to show ... | computer science |
35,162 | Logic Programming for Describing and Solving Planning Problems | cs.AI | A logic programming paradigm which expresses solutions to problems as stable
models has recently been promoted as a declarative approach to solving various
combinatorial and search problems, including planning problems. In this
paradigm, all program rules are considered as constraints and solutions are
stable models of... | computer science |
35,163 | Declarative Representation of Revision Strategies | cs.AI | In this paper we introduce a nonmonotonic framework for belief revision in
which reasoning about the reliability of different pieces of information based
on meta-knowledge about the information is possible, and where revision
strategies can be described declaratively. The approach is based on a
Poole-style system for d... | computer science |
35,164 | DLV - A System for Declarative Problem Solving | cs.AI | DLV is an efficient logic programming and non-monotonic reasoning (LPNMR)
system with advanced knowledge representation mechanisms and interfaces to
classic relational database systems.
Its core language is disjunctive datalog (function-free disjunctive logic
programming) under the Answer Set Semantics with integrity... | computer science |
35,165 | Implementing Integrity Constraints in an Existing Belief Revision System | cs.AI | SNePS is a mature knowledge representation, reasoning, and acting system that
has long contained a belief revision subsystem, called SNeBR. SNeBR is
triggered when an explicit contradiction is introduced into the SNePS belief
space, either because of a user's new assertion, or because of a user's query.
SNeBR then make... | computer science |
35,166 | Coherence, Belief Expansion and Bayesian Networks | cs.AI | We construct a probabilistic coherence measure for information sets which
determines a partial coherence ordering. This measure is applied in
constructing a criterion for expanding our beliefs in the face of new
information. A number of idealizations are being made which can be relaxed by
an appeal to Bayesian Networks... | computer science |
35,167 | Linear Tabulated Resolution Based on Prolog Control Strategy | cs.AI | Infinite loops and redundant computations are long recognized open problems
in Prolog. Two ways have been explored to resolve these problems: loop checking
and tabling. Loop checking can cut infinite loops, but it cannot be both sound
and complete even for function-free logic programs. Tabling seems to be an
effective ... | computer science |
35,168 | PAL: Pertinence Action Language | cs.AI | The current document contains a brief description of a system for Reasoning
about Actions and Change called PAL (Pertinence Action Language) which makes
use of several reasoning properties extracted from a Temporal Expert Systems
tool called Medtool. | computer science |
35,169 | A tableau methodology for deontic conditional logics | cs.LO | In this paper we present a theorem proving methodology for a restricted but
significant fragment of the conditional language made up of (boolean
combinations of) conditional statements with unnested antecedents. The method
is based on the possible world semantics for conditional logics. The KEM label
formalism, designe... | computer science |
35,170 | A note on the Declarative reading(s) of Logic Programming | cs.LO | This paper analyses the declarative readings of logic programming. Logic
programming - and negation as failure - has no unique declarative reading. One
common view is that logic programming is a logic for default reasoning, a
sub-formalism of default logic or autoepistemic logic. In this view, negation
as failure is a ... | computer science |
35,171 | XNMR: A tool for knowledge bases exploration | cs.LO | XNMR is a system designed to explore the results of combining the
well-founded semantics system XSB with the stable-models evaluator SMODELS. Its
main goal is to work as a tool for fast and interactive exploration of
knowledge bases. | computer science |
35,172 | Detecting Unsolvable Queries for Definite Logic Programs | cs.LO | In solving a query, the SLD proof procedure for definite programs sometimes
searches an infinite space for a non existing solution. For example, querying a
planner for an unreachable goal state. Such programs motivate the development
of methods to prove the absence of a solution. Considering the definite program
and th... | computer science |
35,173 | Proceedings of the 8th International Workshop on Non-Monotonic
Reasoning, NMR'2000 | cs.AI | The papers gathered in this collection were presented at the 8th
International Workshop on Nonmonotonic Reasoning, NMR2000. The series was
started by John McCarthy in 1978. The first international NMR workshop was held
at Mohonk Mountain House, New Paltz, New York in June, 1984, and was organized
by Ray Reiter and Bonn... | computer science |
35,174 | Constraint Programming viewed as Rule-based Programming | cs.AI | We study here a natural situation when constraint programming can be entirely
reduced to rule-based programming. To this end we explain first how one can
compute on constraint satisfaction problems using rules represented by simple
first-order formulas. Then we consider constraint satisfaction problems that
are based o... | computer science |
35,175 | Representation results for defeasible logic | cs.LO | The importance of transformations and normal forms in logic programming, and
generally in computer science, is well documented. This paper investigates
transformations and normal forms in the context of Defeasible Logic, a simple
but efficient formalism for nonmonotonic reasoning based on rules and
priorities. The tran... | computer science |
35,176 | Searching for Spaceships | cs.AI | We describe software that searches for spaceships in Conway's Game of Life
and related two-dimensional cellular automata. Our program searches through a
state space related to the de Bruijn graph of the automaton, using a method
that combines features of breadth first and iterative deepening search, and
includes fast b... | computer science |
35,177 | A Denotational Semantics for First-Order Logic | cs.PL | In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational
interpretation of first-order formulas over arbitrary interpretations. Here we
complement this work by introducing a denotational semantics for first-order
logic. Additionally, by allowing an assignment of a non-ground term to a
variable we introdu... | computer science |
35,178 | Extending and Implementing the Stable Model Semantics | cs.LO | An algorithm for computing the stable model semantics of logic programs is
developed. It is shown that one can extend the semantics and the algorithm to
handle new and more expressive types of rules. Emphasis is placed on the use of
efficient implementation techniques. In particular, an implementation of
lookahead that... | computer science |
35,179 | An Average Analysis of Backtracking on Random Constraint Satisfaction
Problems | cs.CC | In this paper we propose a random CSP model, called Model GB, which is a
natural generalization of standard Model B. It is proved that Model GB in which
each constraint is easy to satisfy exhibits non-trivial behaviour (not
trivially satisfiable or unsatisfiable) as the number of variables approaches
infinity. A detail... | computer science |
35,180 | Reasoning with Axioms: Theory and Pratice | cs.LO | When reasoning in description, modal or temporal logics it is often useful to
consider axioms representing universal truths in the domain of discourse.
Reasoning with respect to an arbitrary set of axioms is hard, even for
relatively inexpressive logics, and it is essential to deal with such axioms in
an efficient mann... | computer science |
35,181 | Practical Reasoning for Very Expressive Description Logics | cs.LO | Description Logics (DLs) are a family of knowledge representation formalisms
mainly characterised by constructors to build complex concepts and roles from
atomic ones. Expressive role constructors are important in many applications,
but can be computationally problematical. We present an algorithm that decides
satisfia... | computer science |
35,182 | Practical Reasoning for Expressive Description Logics | cs.LO | Description Logics (DLs) are a family of knowledge representation formalisms
mainly characterised by constructors to build complex concepts and roles from
atomic ones. Expressive role constructors are important in many applications,
but can be computationally problematical. We present an algorithm that decides
satisfia... | computer science |
35,183 | Reasoning with Individuals for the Description Logic SHIQ | cs.LO | While there has been a great deal of work on the development of reasoning
algorithms for expressive description logics, in most cases only Tbox reasoning
is considered. In this paper we present an algorithm for combined Tbox and Abox
reasoning in the SHIQ description logic. This algorithm is of particular
interest as i... | computer science |
35,184 | The SAT Phase Transition | cs.AI | Phase transition is an important feature of SAT problem. For random k-SAT
model, it is proved that as r (ratio of clauses to variables) increases, the
structure of solutions will undergo a sudden change like satisfiability phase
transition when r reaches a threshold point. This phenomenon shows that the
satisfying trut... | computer science |
35,185 | Axiomatizing Causal Reasoning | cs.AI | Causal models defined in terms of a collection of equations, as defined by
Pearl, are axiomatized here. Axiomatizations are provided for three
successively more general classes of causal models: (1) the class of recursive
theories (those without feedback), (2) the class of theories where the
solutions to the equations ... | computer science |
35,186 | Knowledge and common knowledge in a distributed environment | cs.DC | Reasoning about knowledge seems to play a fundamental role in distributed
systems. Indeed, such reasoning is a central part of the informal intuitive
arguments used in the design of distributed protocols. Communication in a
distributed system can be viewed as the act of transforming the system's state
of knowledge. Thi... | computer science |
35,187 | Verifying Termination of General Logic Programs with Concrete Queries | cs.AI | We introduce a method of verifying termination of logic programs with respect
to concrete queries (instead of abstract query patterns). A necessary and
sufficient condition is established and an algorithm for automatic verification
is developed. In contrast to existing query pattern-based approaches, our
method has the... | computer science |
35,188 | Interval Constraint Solving for Camera Control and Motion Planning | cs.AI | Many problems in robust control and motion planning can be reduced to either
find a sound approximation of the solution space determined by a set of
nonlinear inequalities, or to the ``guaranteed tuning problem'' as defined by
Jaulin and Walter, which amounts to finding a value for some tuning parameter
such that a set... | computer science |
35,189 | Knowledge on Treelike Spaces | cs.LO | This paper presents a bimodal logic for reasoning about knowledge during
knowledge acquisition. One of the modalities represents (effort during)
non-deterministic time and the other represents knowledge. The semantics of
this logic are tree-like spaces which are a generalization of semantics used
for modeling branching... | computer science |
35,190 | To Preference via Entrenchment | cs.LO | We introduce a simple generalization of Gardenfors and Makinson's epistemic
entrenchment called partial entrenchment. We show that preferential inference
can be generated as the sceptical counterpart of an inference mechanism defined
directly on partial entrenchment. | computer science |
35,191 | Modal Logics for Topological Spaces | cs.LO | In this thesis we shall present two logical systems, MP and MP, for the
purpose of reasoning about knowledge and effort. These logical systems will be
interpreted in a spatial context and therefore, the abstract concepts of
knowledge and effort will be defined by concrete mathematical concepts. | computer science |
35,192 | Ordering-based Representations of Rational Inference | cs.LO | Rational inference relations were introduced by Lehmann and Magidor as the
ideal systems for drawing conclusions from a conditional base. However, there
has been no simple characterization of these relations, other than its original
representation by preferential models. In this paper, we shall characterize
them with a... | computer science |
35,193 | Entrenchment Relations: A Uniform Approach to Nonmonotonicity | cs.LO | We show that Gabbay's nonmonotonic consequence relations can be reduced to a
new family of relations, called entrenchment relations. Entrenchment relations
provide a direct generalization of epistemic entrenchment and expectation
ordering introduced by Gardenfors and Makinson for the study of belief revision
and expect... | computer science |
35,194 | Super Logic Programs | cs.AI | The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful
nonmonotic formalism introduced by Teodor Przymusinski in 1994. In this paper,
we specialize it to a class of theories called `super logic programs'. We argue
that these programs form a natural generalization of standard logic programs.
In particular,... | computer science |
35,195 | Order-consistent programs are cautiously monotonic | cs.LO | Some normal logic programs under the answer set (stable model) semantics lack
the appealing property of "cautious monotonicity." That is, augmenting a
program with one of its consequences may cause it to lose another of its
consequences. The syntactic condition of "order-consistency" was shown by Fages
to guarantee exi... | computer science |
35,196 | Improving Performance of heavily loaded agents | cs.MA | With the increase in agent-based applications, there are now agent systems
that support \emph{concurrent} client accesses. The ability to process large
volumes of simultaneous requests is critical in many such applications. In such
a setting, the traditional approach of serving these requests one at a time via
queues (... | computer science |
35,198 | Belief Revision: A Critique | cs.AI | We examine carefully the rationale underlying the approaches to belief change
taken in the literature, and highlight what we view as methodological problems.
We argue that to study belief change carefully, we must be quite explicit about
the ``ontology'' or scenario underlying the belief change process. This is
somethi... | computer science |
35,199 | Local Search Techniques for Constrained Portfolio Selection Problems | cs.CE | We consider the problem of selecting a portfolio of assets that provides the
investor a suitable balance of expected return and risk. With respect to the
seminal mean-variance model of Markowitz, we consider additional constraints on
the cardinality of the portfolio and on the quantity of individual shares. Such
constr... | computer science |
35,200 | The alldifferent Constraint: A Survey | cs.PL | The constraint of difference is known to the constraint programming community
since Lauriere introduced Alice in 1978. Since then, several solving strategies
have been designed for this constraint. In this paper we give both a practical
overview and an abstract comparison of these different strategies. | computer science |
35,201 | Optimization Over Zonotopes and Training Support Vector Machines | cs.CG | We make a connection between classical polytopes called zonotopes and Support
Vector Machine (SVM) classifiers. We combine this connection with the ellipsoid
method to give some new theoretical results on training SVMs. We also describe
some special properties of soft margin C-SVMs as parameter C goes to infinity. | computer science |
35,202 | Disjunctive Logic Programs with Inheritance | cs.LO | The paper proposes a new knowledge representation language, called DLP<,
which extends disjunctive logic programming (with strong negation) by
inheritance. The addition of inheritance enhances the knowledge modeling
features of the language providing a natural representation of default
reasoning with exceptions.
A de... | computer science |
35,203 | Soft Scheduling | cs.AI | Classical notions of disjunctive and cumulative scheduling are studied from
the point of view of soft constraint satisfaction. Soft disjunctive scheduling
is introduced as an instance of soft CSP and preferences included in this
problem are applied to generate a lower bound based on existing discrete
capacity resource.... | computer science |
35,204 | The Representation of Legal Contracts | cs.AI | The paper outlines ongoing research on logic-based tools for the analysis and
representation of legal contracts of the kind frequently encountered in
large-scale engineering projects and complex, long-term trading agreements. We
consider both contract formation and contract performance, in each case
identifying the rep... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.