Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,205 | Computing Functional and Relational Box Consistency by Structured
Propagation in Atomic Constraint Systems | cs.PL | Box consistency has been observed to yield exponentially better performance
than chaotic constraint propagation in the interval constraint system obtained
by decomposing the original expression into primitive constraints. The claim
was made that the improvement is due to avoiding decomposition. In this paper
we argue t... | computer science |
35,206 | Modelling Legal Contracts as Processes | cs.AI | This paper concentrates on the representation of the legal relations that
obtain between parties once they have entered a contractual agreement and their
evolution as the agreement progresses through time. Contracts are regarded as
process and they are analysed in terms of the obligations that are active at
various poi... | computer science |
35,207 | Complexity Results and Practical Algorithms for Logics in Knowledge
Representation | cs.LO | Description Logics (DLs) are used in knowledge-based systems to represent and
reason about terminological knowledge of the application domain in a
semantically well-defined manner. In this thesis, we establish a number of
novel complexity results and give practical algorithms for expressive DLs that
provide different f... | computer science |
35,208 | The Logic Programming Paradigm and Prolog | cs.PL | This is a tutorial on logic programming and Prolog appropriate for a course
on programming languages for students familiar with imperative programming. | computer science |
35,209 | Annotated revision programs | cs.AI | Revision programming is a formalism to describe and enforce updates of belief
sets and databases. That formalism was extended by Fitting who assigned
annotations to revision atoms. Annotations provide a way to quantify the
confidence (probability) that a revision atom holds. The main goal of our paper
is to reexamine t... | computer science |
35,210 | Fixed-parameter complexity of semantics for logic programs | cs.LO | A decision problem is called parameterized if its input is a pair of strings.
One of these strings is referred to as a parameter. The problem: given a
propositional logic program P and a non-negative integer k, decide whether P
has a stable model of size no more than k, is an example of a parameterized
decision problem... | computer science |
35,211 | Propositional satisfiability in answer-set programming | cs.AI | We show that propositional logic and its extensions can support answer-set
programming in the same way stable logic programming and disjunctive logic
programming do. To this end, we introduce a logic based on the logic of
propositional schemata and on a version of the Closed World Assumption. We call
it the extended lo... | computer science |
35,212 | aspps --- an implementation of answer-set programming with propositional
schemata | cs.AI | We present an implementation of an answer-set programming paradigm, called
aspps (short for answer-set programming with propositional schemata). The
system aspps is designed to process PS+ theories. It consists of two basic
modules. The first module, psgrnd, grounds an PS+ theory. The second module,
referred to as aspp... | computer science |
35,213 | Using Methods of Declarative Logic Programming for Intelligent
Information Agents | cs.MA | The search for information on the web is faced with several problems, which
arise on the one hand from the vast number of available sources, and on the
other hand from their heterogeneity. A promising approach is the use of
multi-agent systems of information agents, which cooperatively solve advanced
information-retrie... | computer science |
35,214 | Convergent Approximate Solving of First-Order Constraints by Approximate
Quantifiers | cs.LO | Exactly solving first-order constraints (i.e., first-order formulas over a
certain predefined structure) can be a very hard, or even undecidable problem.
In continuous structures like the real numbers it is promising to compute
approximate solutions instead of exact ones. However, the quantifiers of the
first-order pre... | computer science |
35,215 | Assigning Satisfaction Values to Constraints: An Algorithm to Solve
Dynamic Meta-Constraints | cs.PL | The model of Dynamic Meta-Constraints has special activity constraints which
can activate other constraints. It also has meta-constraints which range over
other constraints. An algorithm is presented in which constraints can be
assigned one of five different satisfaction values, which leads to the
assignment of domain ... | computer science |
35,216 | Interactive Timetabling | cs.PL | Timetabling is a typical application of constraint programming whose task is
to allocate activities to slots in available resources respecting various
constraints like precedence and capacity. In this paper we present a basic
concept, a constraint model, and the solving algorithms for interactive
timetabling. Interacti... | computer science |
35,217 | Dynamic Global Constraints: A First View | cs.PL | Global constraints proved themselves to be an efficient tool for modelling
and solving large-scale real-life combinatorial problems. They encapsulate a
set of binary constraints and using global reasoning about this set they filter
the domains of involved variables better than arc consistency among the set of
binary co... | computer science |
35,218 | Intelligent Search of Correlated Alarms from Database containing Noise
Data | cs.NI | Alarm correlation plays an important role in improving the service and
reliability in modern telecommunications networks. Most previous research of
alarm correlation didn't consider the effect of noise data in Database. This
paper focuses on the method of discovering alarm correlation rules from
database containing noi... | computer science |
35,219 | The temporal calculus of conditional objects and conditional events | cs.AI | We consider the problem of defining conditional objects (a|b), which would
allow one to regard the conditional probability Pr(a|b) as a probability of a
well-defined event rather than as a shorthand for Pr(ab)/Pr(b). The next issue
is to define boolean combinations of conditional objects, and possibly also the
operator... | computer science |
35,220 | Embedding conditional event algebras into temporal calculus of
conditionals | cs.AI | In this paper we prove that all the existing conditional event algebras embed
into a three-valued extension of temporal logic of discrete past time, which
the authors of this paper have proposed in anothe paper as a general model of
conditional events.
First of all, we discuss the descriptive incompleteness of the ce... | computer science |
35,221 | A logic-based approach to data integration | cs.DB | An important aspect of data integration involves answering queries using
various resources rather than by accessing database relations. The process of
transforming a query from the database relations to the resources is often
referred to as query folding or answering queries using views, where the views
are the resourc... | computer science |
35,222 | Intelligent Anticipated Exploration of Web Sites | cs.AI | In this paper we describe a web search agent, called Global Search Agent
(hereafter GSA for short). GSA integrates and enhances several search
techniques in order to achieve significant improvements in the user-perceived
quality of delivered information as compared to usual web search engines. GSA
features intelligent ... | computer science |
35,223 | Data Acquisition and Database Management System for Samsung
Superconductor Test Facility | cs.DB | In order to fulfill the test requirement of KSTAR (Korea Superconducting
Tokamak Advanced Research) superconducting magnet system, a large scale
superconducting magnet and conductor test facility, SSTF (Samsung
Superconductor Test Facility), has been constructed at Samsung Advanced
Institute of Technology. The computer... | computer science |
35,224 | Bayesian Logic Programs | cs.AI | Bayesian networks provide an elegant formalism for representing and reasoning
about uncertainty using probability theory. Theyare a probabilistic extension
of propositional logic and, hence, inherit some of the limitations of
propositional logic, such as the difficulties to represent objects and
relations. We introduce... | computer science |
35,225 | A Logic Programming Approach to Knowledge-State Planning: Semantics and
Complexity | cs.AI | We propose a new declarative planning language, called K, which is based on
principles and methods of logic programming. In this language, transitions
between states of knowledge can be described, rather than transitions between
completely described states of the world, which makes the language well-suited
for planning... | computer science |
35,226 | A Tight Upper Bound on the Number of Candidate Patterns | cs.DB | In the context of mining for frequent patterns using the standard levelwise
algorithm, the following question arises: given the current level and the
current set of frequent patterns, what is the maximal number of candidate
patterns that can be generated on the next level? We answer this question by
providing a tight u... | computer science |
35,227 | Representation of Uncertainty for Limit Processes | cs.AI | Many mathematical models utilize limit processes. Continuous functions and
the calculus, differential equations and topology, all are based on limits and
continuity. However, when we perform measurements and computations, we can
achieve only approximate results. In some cases, this discrepancy between
theoretical schem... | computer science |
35,228 | Interactive Constrained Association Rule Mining | cs.DB | We investigate ways to support interactive mining sessions, in the setting of
association rule mining. In such sessions, users specify conditions (queries)
on the associations to be generated. Our approach is a combination of the
integration of querying conditions inside the mining phase, and the incremental
querying o... | computer science |
35,229 | A Data Mining Framework for Optimal Product Selection in Retail
Supermarket Data: The Generalized PROFSET Model | cs.DB | In recent years, data mining researchers have developed efficient association
rule algorithms for retail market basket analysis. Still, retailers often
complain about how to adopt association rules to optimize concrete retail
marketing-mix decisions. It is in this context that, in a previous paper, the
authors have int... | computer science |
35,230 | Computing Preferred Answer Sets by Meta-Interpretation in Answer Set
Programming | cs.LO | Most recently, Answer Set Programming (ASP) is attracting interest as a new
paradigm for problem solving. An important aspect which needs to be supported
is the handling of preferences between rules, for which several approaches have
been presented. In this paper, we consider the problem of implementing
preference hand... | computer science |
35,231 | Collusion in Unrepeated, First-Price Auctions with an Uncertain Number
of Participants | cs.GT | We consider the question of whether collusion among bidders (a "bidding
ring") can be supported in equilibrium of unrepeated first-price auctions.
Unlike previous work on the topic such as that by McAfee and McMillan [1992]
and Marshall and Marx [2007], we do not assume that non-colluding agents have
perfect knowledge ... | computer science |
35,232 | A Modal Logic Framework for Multi-agent Belief Fusion | cs.AI | This paper is aimed at providing a uniform framework for reasoning about
beliefs of multiple agents and their fusion. In the first part of the paper, we
develop logics for reasoning about cautiously merged beliefs of agents with
different degrees of reliability. The logics are obtained by combining the
multi-agent epis... | computer science |
35,233 | The Deductive Database System LDL++ | cs.DB | This paper describes the LDL++ system and the research advances that have
enabled its design and development. We begin by discussing the new nonmonotonic
and nondeterministic constructs that extend the functionality of the LDL++
language, while preserving its model-theoretic and fixpoint semantics. Then, we
describe th... | computer science |
35,234 | A Qualitative Dynamical Modelling Approach to Capital Accumulation in
Unregulated Fisheries | cs.AI | Capital accumulation has been a major issue in fisheries economics over the
last two decades, whereby the interaction of the fish and capital stocks were
of particular interest. Because bio-economic systems are intrinsically complex,
previous efforts in this field have relied on a variety of simplifying
assumptions. Th... | computer science |
35,235 | Logic program specialisation through partial deduction: Control issues | cs.PL | Program specialisation aims at improving the overall performance of programs
by performing source to source transformations. A common approach within
functional and logic programming, known respectively as partial evaluation and
partial deduction, is to exploit partial knowledge about the input. It is
achieved through ... | computer science |
35,236 | Linear Programming helps solving large multi-unit combinatorial auctions | cs.GT | Previous works suggested the use of Branch and Bound techniques for finding
the optimal allocation in (multi-unit) combinatorial auctions. They remarked
that Linear Programming could provide a good upper-bound to the optimal
allocation, but they went on using lighter and less tight upper-bound
heuristics, on the ground... | computer science |
35,237 | Generalized Qualitative Probability: Savage revisited | cs.GT | Preferences among acts are analyzed in the style of L. Savage, but as
partially ordered. The rationality postulates considered are weaker than
Savage's on three counts. The Sure Thing Principle is derived in this setting.
The postulates are shown to lead to a characterization of generalized
qualitative probability that... | computer science |
35,238 | Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and
Bound Heuristics | cs.GT | Finding optimal solutions for multi-unit combinatorial auctions is a hard
problem and finding approximations to the optimal solution is also hard. We
investigate the use of Branch-and-Bound techniques: they require both a way to
bound from above the value of the best allocation and a good criterion to
decide which bids... | computer science |
35,239 | Representing and Aggregating Conflicting Beliefs | cs.AI | We consider the two-fold problem of representing collective beliefs and
aggregating these beliefs. We propose modular, transitive relations for
collective beliefs. They allow us to represent conflicting opinions and they
have a clear semantics. We compare them with the quasi-transitive relations
often used in Social Ch... | computer science |
35,240 | NetNeg: A Connectionist-Agent Integrated System for Representing Musical
Knowledge | cs.AI | The system presented here shows the feasibility of modeling the knowledge
involved in a complex musical activity by integrating sub-symbolic and symbolic
processes. This research focuses on the question of whether there is any
advantage in integrating a neural network together with a distributed
artificial intelligence... | computer science |
35,241 | The Algorithms of Updating Sequential Patterns | cs.DB | Because the data being mined in the temporal database will evolve with time,
many researchers have focused on the incremental mining of frequent sequences
in temporal database. In this paper, we propose an algorithm called IUS, using
the frequent and negative border sequences in the original database for
incremental se... | computer science |
35,242 | When to Update the sequential patterns of stream data? | cs.DB | In this paper, we first define a difference measure between the old and new
sequential patterns of stream data, which is proved to be a distance. Then we
propose an experimental method, called TPD (Tradeoff between Performance and
Difference), to decide when to update the sequential patterns of stream data by
making a ... | computer science |
35,243 | Fast Hands-free Writing by Gaze Direction | cs.HC | We describe a method for text entry based on inverse arithmetic coding that
relies on gaze direction and which is faster and more accurate than using an
on-screen keyboard.
These benefits are derived from two innovations: the writing task is matched
to the capabilities of the eye, and a language model is used to make... | computer science |
35,244 | Robust Global Localization Using Clustered Particle Filtering | cs.RO | Global mobile robot localization is the problem of determining a robot's pose
in an environment, using sensor data, when the starting position is unknown. A
family of probabilistic algorithms known as Monte Carlo Localization (MCL) is
currently among the most popular methods for solving this problem. MCL
algorithms rep... | computer science |
35,245 | Sampling Strategies for Mining in Data-Scarce Domains | cs.CE | Data mining has traditionally focused on the task of drawing inferences from
large datasets. However, many scientific and engineering domains, such as fluid
dynamics and aircraft design, are characterized by scarce data, due to the
expense and complexity of associated experiments and simulations. In such
data-scarce do... | computer science |
35,246 | Qualitative Analysis of Correspondence for Experimental Algorithmics | cs.AI | Correspondence identifies relationships among objects via similarities among
their components; it is ubiquitous in the analysis of spatial datasets,
including images, weather maps, and computational simulations. This paper
develops a novel multi-level mechanism for qualitative analysis of
correspondence. Operators leve... | computer science |
35,247 | Intelligent Search of Correlated Alarms for GSM Networks with
Model-based Constraints | cs.NI | In order to control the process of data mining and focus on the things of
interest to us, many kinds of constraints have been added into the algorithms
of data mining. However, discovering the correlated alarms in the alarm
database needs deep domain constraints. Because the correlated alarms greatly
depend on the logi... | computer science |
35,248 | Computing stable models: worst-case performance estimates | cs.LO | We study algorithms for computing stable models of propositional logic
programs and derive estimates on their worst-case performance that are
asymptotically better than the trivial bound of O(m 2^n), where m is the size
of an input program and n is the number of its atoms. For instance, for
programs, whose clauses cons... | computer science |
35,249 | The Traits of the Personable | cs.AI | Information personalization is fertile ground for application of AI
techniques. In this article I relate personalization to the ability to capture
partial information in an information-seeking interaction. The specific focus
is on personalizing interactions at web sites. Using ideas from partial
evaluation and explanat... | computer science |
35,250 | A Spectrum of Applications of Automated Reasoning | cs.AI | The likelihood of an automated reasoning program being of substantial
assistance for a wide spectrum of applications rests with the nature of the
options and parameters it offers on which to base needed strategies and
methodologies. This article focuses on such a spectrum, featuring W. McCune's
program OTTER, discussin... | computer science |
35,251 | Connectives in Quantum and other Cumulative Logics | cs.AI | Cumulative logics are studied in an abstract setting, i.e., without
connectives, very much in the spirit of Makinson's early work. A powerful
representation theorem characterizes those logics by choice functions that
satisfy a weakening of Sen's property alpha, in the spirit of the author's
"Nonmonotonic Logics and Sem... | computer science |
35,252 | Mining All Non-Derivable Frequent Itemsets | cs.DB | Recent studies on frequent itemset mining algorithms resulted in significant
performance improvements. However, if the minimal support threshold is set too
low, or the data is highly correlated, the number of frequent itemsets itself
can be prohibitively large. To overcome this problem, recently several
proposals have ... | computer science |
35,253 | Relational Association Rules: getting WARMeR | cs.DB | In recent years, the problem of association rule mining in transactional data
has been well studied. We propose to extend the discovery of classical
association rules to the discovery of association rules of conjunctive queries
in arbitrary relational data, inspired by the WARMR algorithm, developed by
Dehaspe and Toiv... | computer science |
35,254 | Knowledge management for enterprises (Wissensmanagement fuer
Unternehmen) | cs.IR | Although knowledge is one of the most valuable resource of enterprises and an
important production and competition factor, this intellectual potential is
often used (or maintained) only inadequate by the enterprises. Therefore, in a
globalised and growing market the optimal usage of existing knowledge
represents a key ... | computer science |
35,255 | Agent Programming with Declarative Goals | cs.AI | A long and lasting problem in agent research has been to close the gap
between agent logics and agent programming frameworks. The main reason for this
problem of establishing a link between agent logics and agent programming
frameworks is identified and explained by the fact that agent programming
frameworks have not i... | computer science |
35,256 | Intuitions and the modelling of defeasible reasoning: some case studies | cs.AI | The purpose of this paper is to address some criticisms recently raised by
John Horty in two articles against the validity of two commonly accepted
defeasible reasoning patterns, viz. reinstatement and floating conclusions. I
shall argue that Horty's counterexamples, although they significantly raise our
understanding ... | computer science |
35,257 | Alternative Characterizations for Strong Equivalence of Logic Programs | cs.AI | In this work we present additional results related to the property of strong
equivalence of logic programs. This property asserts that two programs share
the same set of stable models, even under the addition of new rules. As shown
in a recent work by Lifschitz, Pearce and Valverde, strong equivalence can be
simply red... | computer science |
35,258 | Some logics of belief and disbelief | cs.AI | The introduction of explicit notions of rejection, or disbelief, into logics
for knowledge representation can be justified in a number of ways. Motivations
range from the need for versions of negation weaker than classical negation, to
the explicit recording of classic belief contraction operations in the area of
belie... | computer science |
35,259 | Iterated revision and the axiom of recovery: a unified treatment via
epistemic states | cs.AI | The axiom of recovery, while capturing a central intuition regarding belief
change, has been the source of much controversy. We argue briefly against
putative counterexamples to the axiom--while agreeing that some of their
insight deserves to be preserved--and present additional recovery-like axioms
in a framework that... | computer science |
35,260 | Well-Founded Argumentation Semantics for Extended Logic Programming | cs.LO | This paper defines an argumentation semantics for extended logic programming
and shows its equivalence to the well-founded semantics with explicit negation.
We set up a general framework in which we extensively compare this semantics to
other argumentation semantics, including those of Dung, and Prakken and Sartor.
We ... | computer science |
35,261 | The Rise and Fall of the Church-Turing Thesis | cs.CC | The essay consists of three parts. In the first part, it is explained how
theory of algorithms and computations evaluates the contemporary situation with
computers and global networks. In the second part, it is demonstrated what new
perspectives this theory opens through its new direction that is called theory
of super... | computer science |
35,262 | Interpolation Theorems for Nonmonotonic Reasoning Systems | cs.AI | Craig's interpolation theorem (Craig 1957) is an important theorem known for
propositional logic and first-order logic. It says that if a logical formula
$\beta$ logically follows from a formula $\alpha$, then there is a formula
$\gamma$, including only symbols that appear in both $\alpha,\beta$, such that
$\beta$ logi... | computer science |
35,263 | A Polynomial Translation of Logic Programs with Nested Expressions into
Disjunctive Logic Programs: Preliminary Report | cs.AI | Nested logic programs have recently been introduced in order to allow for
arbitrarily nested formulas in the heads and the bodies of logic program rules
under the answer sets semantics. Nested expressions can be formed using
conjunction, disjunction, as well as the negation as failure operator in an
unrestricted fashio... | computer science |
35,264 | Reinforcing Reachable Routes | cs.NI | This paper studies the evaluation of routing algorithms from the perspective
of reachability routing, where the goal is to determine all paths between a
sender and a receiver. Reachability routing is becoming relevant with the
changing dynamics of the Internet and the emergence of low-bandwidth
wireless/ad-hoc networks... | computer science |
35,265 | A Paraconsistent Higher Order Logic | cs.LO | Classical logic predicts that everything (thus nothing useful at all) follows
from inconsistency. A paraconsistent logic is a logic where an inconsistency
does not lead to such an explosion, and since in practice consistency is
difficult to achieve there are many potential applications of paraconsistent
logics in knowl... | computer science |
35,266 | Soft Concurrent Constraint Programming | cs.PL | Soft constraints extend classical constraints to represent multiple
consistency levels, and thus provide a way to express preferences, fuzziness,
and uncertainty. While there are many soft constraint solving formalisms, even
distributed ones, by now there seems to be no concurrent programming framework
where soft const... | computer science |
35,267 | Offline Specialisation in Prolog Using a Hand-Written Compiler Generator | cs.PL | The so called ``cogen approach'' to program specialisation, writing a
compiler generator instead of a specialiser, has been used with considerable
success in partial evaluation of both functional and imperative languages. This
paper demonstrates that the cogen approach is also applicable to the
specialisation of logic ... | computer science |
35,268 | Complete Axiomatizations for Reasoning About Knowledge and Time | cs.LO | Sound and complete axiomatizations are provided for a number of different
logics involving modalities for knowledge and time. These logics arise from
different choices for various parameters. All the logics considered involve the
discrete time linear temporal logic operators `next' and `until' and an
operator for the k... | computer science |
35,269 | Compilability of Abduction | cs.AI | Abduction is one of the most important forms of reasoning; it has been
successfully applied to several practical problems such as diagnosis. In this
paper we investigate whether the computational complexity of abduction can be
reduced by an appropriate use of preprocessing. This is motivated by the fact
that part of th... | computer science |
35,270 | Geometric Aspects of Multiagent Systems | cs.MA | Recent advances in Multiagent Systems (MAS) and Epistemic Logic within
Distributed Systems Theory, have used various combinatorial structures that
model both the geometry of the systems and the Kripke model structure of models
for the logic. Examining one of the simpler versions of these models,
interpreted systems, an... | computer science |
35,271 | Encoding a Taxonomy of Web Attacks with Different-Length Vectors | cs.CR | Web attacks, i.e. attacks exclusively using the HTTP protocol, are rapidly
becoming one of the fundamental threats for information systems connected to
the Internet. When the attacks suffered by web servers through the years are
analyzed, it is observed that most of them are very similar, using a reduced
number of atta... | computer science |
35,272 | A uniform approach to logic programming semantics | cs.AI | Part of the theory of logic programming and nonmonotonic reasoning concerns
the study of fixed-point semantics for these paradigms. Several different
semantics have been proposed during the last two decades, and some have been
more successful and acknowledged than others. The rationales behind those
various semantics h... | computer science |
35,273 | Vanquishing the XCB Question: The Methodology Discovery of the Last
Shortest Single Axiom for the Equivalential Calculus | cs.LO | With the inclusion of an effective methodology, this article answers in
detail a question that, for a quarter of a century, remained open despite
intense study by various researchers. Is the formula XCB =
e(x,e(e(e(x,y),e(z,y)),z)) a single axiom for the classical equivalential
calculus when the rules of inference cons... | computer science |
35,274 | XCB, the Last of the Shortest Single Axioms for the Classical
Equivalential Calculus | cs.LO | It has long been an open question whether the formula XCB = EpEEEpqErqr is,
with the rules of substitution and detachment, a single axiom for the classical
equivalential calculus. This paper answers that question affirmatively, thus
completing a search for all such eleven-symbol single axioms that began seventy
years a... | computer science |
35,275 | Thinking Adaptive: Towards a Behaviours Virtual Laboratory | cs.AI | In this paper we name some of the advantages of virtual laboratories; and
propose that a Behaviours Virtual Laboratory should be useful for both
biologists and AI researchers, offering a new perspective for understanding
adaptive behaviour. We present our development of a Behaviours Virtual
Laboratory, which at this st... | computer science |
35,276 | Redundancy in Logic I: CNF Propositional Formulae | cs.AI | A knowledge base is redundant if it contains parts that can be inferred from
the rest of it. We study the problem of checking whether a CNF formula (a set
of clauses) is redundant, that is, it contains clauses that can be derived from
the other ones. Any CNF formula can be made irredundant by deleting some of its
claus... | computer science |
35,277 | Propositional satisfiability in declarative programming | cs.LO | Answer-set programming (ASP) paradigm is a way of using logic to solve search
problems. Given a search problem, to solve it one designs a theory in the logic
so that models of this theory represent problem solutions. To compute a
solution to a problem one needs to compute a model of the corresponding theory.
Several an... | computer science |
35,278 | Monadic Style Control Constructs for Inference Systems | cs.AI | Recent advances in programming languages study and design have established a
standard way of grounding computational systems representation in category
theory. These formal results led to a better understanding of issues of control
and side-effects in functional and imperative languages. Another benefit is a
better way... | computer science |
35,279 | Merging Locally Correct Knowledge Bases: A Preliminary Report | cs.AI | Belief integration methods are often aimed at deriving a single and
consistent knowledge base that retains as much as possible of the knowledge
bases to integrate. The rationale behind this approach is the minimal change
principle: the result of the integration process should differ as less as
possible from the knowled... | computer science |
35,280 | Formal Concept Analysis and Resolution in Algebraic Domains | cs.LO | We relate two formerly independent areas: Formal concept analysis and logic
of domains. We will establish a correspondene between contextual attribute
logic on formal contexts resp. concept lattices and a clausal logic on coherent
algebraic cpos. We show how to identify the notion of formal concept in the
domain theore... | computer science |
35,281 | Tight Logic Programs | cs.AI | This note is about the relationship between two theories of negation as
failure -- one based on program completion, the other based on stable models,
or answer sets. Francois Fages showed that if a logic program satisfies a
certain syntactic condition, which is now called ``tightness,'' then its stable
models can be ch... | computer science |
35,282 | Conferences with Internet Web-Casting as Binding Events in a Global
Brain: Example Data From Complexity Digest | cs.NI | There is likeness of the Internet to human brains which has led to the
metaphor of the world-wide computer network as a `Global Brain'. We consider
conferences as 'binding events' in the Global Brain that can lead to
metacognitive structures on a global scale. One of the critical factors for
that phenomenon to happen (... | computer science |
35,283 | Dempster's Rule for Evidence Ordered in a Complete Directed Acyclic
Graph | cs.AI | For the case of evidence ordered in a complete directed acyclic graph this
paper presents a new algorithm with lower computational complexity for
Dempster's rule than that of step-by-step application of Dempster's rule. In
this problem, every original pair of evidences, has a corresponding evidence
against the simultan... | computer science |
35,284 | Beslutstödssystemet Dezzy - en översikt | cs.AI | Within the scope of the three-year ANTI-SUBMARINE WARFARE project of the
National Defence Research Establishment, the INFORMATION SYSTEMS subproject has
developed the demonstration prototype Dezzy for handling and analysis of
intelligence reports concerning foreign underwater activities.
-----
Inom ramen f\"or FOA:... | computer science |
35,285 | Bounded LTL Model Checking with Stable Models | cs.LO | In this paper bounded model checking of asynchronous concurrent systems is
introduced as a promising application area for answer set programming. As the
model of asynchronous systems a generalisation of communicating automata,
1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a
requirement on the beha... | computer science |
35,286 | Lexicographic probability, conditional probability, and nonstandard
probability | cs.GT | The relationship between Popper spaces (conditional probability spaces that
satisfy some regularity conditions), lexicographic probability systems (LPS's),
and nonstandard probability spaces (NPS's) is considered. If countable
additivity is assumed, Popper spaces and a subclass of LPS's are equivalent;
without the assu... | computer science |
35,287 | D0 Data Handling Operational Experience | cs.DC | We report on the production experience of the D0 experiment at the Fermilab
Tevatron, using the SAM data handling system with a variety of computing
hardware configurations, batch systems, and mass storage strategies. We have
stored more than 300 TB of data in the Fermilab Enstore mass storage system. We
deliver data t... | computer science |
35,288 | 'Computing' as Information Compression by Multiple Alignment,
Unification and Search | cs.AI | This paper argues that the operations of a 'Universal Turing Machine' (UTM)
and equivalent mechanisms such as the 'Post Canonical System' (PCS) - which are
widely accepted as definitions of the concept of `computing' - may be
interpreted as *information compression by multiple alignment, unification and
search* (ICMAUS... | computer science |
35,289 | Definition and Complexity of Some Basic Metareasoning Problems | cs.AI | In most real-world settings, due to limited time or other resources, an agent
cannot perform all potentially useful deliberation and information gathering
actions. This leads to the metareasoning problem of selecting such actions.
Decision-theoretic methods for metareasoning have been studied in AI, but there
are few t... | computer science |
35,290 | Supporting Dynamic Ad hoc Collaboration Capabilities | cs.OH | Modern HENP experiments such as CMS and Atlas involve as many as 2000
collaborators around the world. Collaborations this large will be unable to
meet often enough to support working closely together. Many of the tools
currently available for collaboration focus on heavy-weight applications such
as videoconferencing to... | computer science |
35,291 | Bridging the gap between modal temporal logics and constraint-based QSR
as an ALC(D) spatio-temporalisation with weakly cyclic TBoxes | cs.AI | The aim of this work is to provide a family of qualitative theories for
spatial change in general, and for motion of spatial scenes in particular. To
achieve this, we consider a spatio-temporalisation MTALC(D_x), of the
well-known ALC(D) family of Description Logics (DLs) with a concrete domainan.
In particular, the co... | computer science |
35,292 | A logic for reasoning about upper probabilities | cs.AI | We present a propositional logic %which can be used to reason about the
uncertainty of events, where the uncertainty is modeled by a set of probability
measures assigning an interval of probability to each event. We give a sound
and complete axiomatization for the logic, and show that the satisfiability
problem is NP-c... | computer science |
35,293 | Modeling Belief in Dynamic Systems, Part I: Foundations | cs.AI | Belief change is a fundamental problem in AI: Agents constantly have to
update their beliefs to accommodate new observations. In recent years, there
has been much work on axiomatic characterizations of belief change. We claim
that a better understanding of belief change can be gained from examining
appropriate semantic... | computer science |
35,294 | Modeling Belief in Dynamic Systems, Part II: Revisions and Update | cs.AI | The study of belief change has been an active area in philosophy and AI. In
recent years two special cases of belief change, belief revision and belief
update, have been studied in detail. In a companion paper, we introduce a new
framework to model belief change. This framework combines temporal and
epistemic modalitie... | computer science |
35,295 | Learning in Multiagent Systems: An Introduction from a Game-Theoretic
Perspective | cs.MA | We introduce the topic of learning in multiagent systems. We first provide a
quick introduction to the field of game theory, focusing on the equilibrium
concepts of iterated dominance, and Nash equilibrium. We show some of the most
relevant findings in the theory of learning in games, including theorems on
fictitious p... | computer science |
35,296 | Model-Based Debugging using Multiple Abstract Models | cs.SE | This paper introduces an automatic debugging framework that relies on
model-based reasoning techniques to locate faults in programs. In particular,
model-based diagnosis, together with an abstract interpretation based conflict
detection mechanism is used to derive diagnoses, which correspond to possible
faults in progr... | computer science |
35,297 | Goedel Machines: Self-Referential Universal Problem Solvers Making
Provably Optimal Self-Improvements | cs.LO | We present the first class of mathematically rigorous, general, fully
self-referential, self-improving, optimally efficient problem solvers. Inspired
by Kurt Goedel's celebrated self-referential formulas (1931), such a problem
solver rewrites any part of its own code as soon as it has found a proof that
the rewrite is ... | computer science |
35,298 | A Hierarchical Situation Calculus | cs.AI | A situation calculus is presented that provides a solution to the frame
problem for hierarchical situations, that is, situations that have a modular
structure in which parts of the situation behave in a relatively independent
manner. This situation calculus is given in a relational, functional, and modal
logic form. Ea... | computer science |
35,299 | Using Artificial Intelligence for Model Selection | cs.AI | We apply the optimization algorithm Adaptive Simulated Annealing (ASA) to the
problem of analyzing data on a large population and selecting the best model to
predict that an individual with various traits will have a particular disease.
We compare ASA with traditional forward and backward regression on computer
simulat... | computer science |
35,300 | Transient Diversity in Multi-Agent Systems | cs.AI | Diversity is an important aspect of highly efficient multi-agent teams. We
introduce the main factors that drive a multi-agent system in either direction
along the diversity scale. A metric for diversity is described, and we
speculate on the concept of transient diversity. Finally, an experiment on
social entropy using... | computer science |
35,301 | Modeling State in Software Debugging of VHDL-RTL Designs -- A
Model-Based Diagnosis Approach | cs.AI | In this paper we outline an approach of applying model-based diagnosis to the
field of automatic software debugging of hardware designs. We present our
value-level model for debugging VHDL-RTL designs and show how to localize the
erroneous component responsible for an observed misbehavior. Furthermore, we
discuss an ex... | computer science |
35,302 | Enhancing a Search Algorithm to Perform Intelligent Backtracking | cs.AI | This paper illustrates how a Prolog program, using chronological backtracking
to find a solution in some search space, can be enhanced to perform intelligent
backtracking. The enhancement crucially relies on the impurity of Prolog that
allows a program to store information when a dead end is reached. To illustrate
the ... | computer science |
35,303 | A Parameterised Hierarchy of Argumentation Semantics for Extended Logic
Programming and its Application to the Well-founded Semantics | cs.LO | Argumentation has proved a useful tool in defining formal semantics for
assumption-based reasoning by viewing a proof as a process in which proponents
and opponents attack each others arguments by undercuts (attack to an
argument's premise) and rebuts (attack to an argument's conclusion). In this
paper, we formulate a ... | computer science |
35,304 | Using Counterfactuals in Knowledge-Based Programming | cs.DC | This paper adds counterfactuals to the framework of knowledge-based programs
of Fagin, Halpern, Moses, and Vardi. The use of counterfactuals is illustrated
by designing a protocol in which an agent stops sending messages once it knows
that it is safe to do so. Such behavior is difficult to capture in the original
frame... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.