Results 1 - 10
of
1,547
BDI Agents: From Theory to Practice
- IN PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON MULTI-AGENT SYSTEMS (ICMAS-95
, 1995
"... The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular typ ..."
Abstract
-
Cited by 892 (3 self)
- Add to MetaCart
The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular
ℓ-diversity: Privacy beyond k-anonymity
- IN ICDE
, 2006
"... Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k-anonymity has gained popularity. In a k-anonymized dataset, each record is indistinguishable from at least k − 1 other records with resp ..."
Abstract
-
Cited by 672 (13 self)
- Add to MetaCart
-diversity that can defend against such attacks. In addition to building a formal foundation for ℓ-diversity, we show in an experimental evaluation that ℓ-diversity is practical and can be implemented efficiently.
The DLV System for Knowledge Representation and Reasoning
- ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract
-
Cited by 456 (102 self)
- Add to MetaCart
problems of lower complexity in a simpler and more natural fashion. This paper presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel
Analogical Mapping by Constraint Satisfaction
- COGNITIVE SCIENCE 13, 29-5 (1989)
, 1989
"... A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of th ..."
Abstract
-
Cited by 397 (29 self)
- Add to MetaCart
identifies mapping hypotheses that collectively represent the overall mapping that best fits the interactlng constraints. ACME has been applied to a wide range of examples that include problem analogies, analogical arguments, explanatory analogies, story analogies, formal analogies, and metaphors. ACME
Defeasible Logic Programming: An Argumentative Approach. Theory and Practice
- of Logic Programming
, 2004
"... The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation infe ..."
Abstract
-
Cited by 233 (57 self)
- Add to MetaCart
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation
A Formal Specification of dMARS
, 1998
"... The Procedural Reasoning System (PRS) is the best established agent architecture currently available. It has been deployed in many major industrial applications, ranging from fault diagnosis on the space shuttle to air traffic management and business process control. The theory of PRS-like syst ..."
Abstract
-
Cited by 183 (27 self)
- Add to MetaCart
an abstract formal model of an idealised dMARS system (the most recent implementation of the PRS...
A Foundation for Representing and Querying Moving Objects
, 2000
"... Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously which describe moving objects. Two fundamental abstractions are moving ..."
Abstract
-
Cited by 200 (39 self)
- Add to MetaCart
. The paper o ers a precise and conceptually clean foundation for implementing a spatio-temporal DBMS extension.
An argumentative formalism for implementing rational agents
- In Proceedings del 2do Workshop en Agentes y Sistemas Inteligentes (WASI), 7mo Congreso Argentino de Ciencias de la Computación (CACIC
, 2001
"... The design of intelligent agents is a key issue for many applications. Although there is no universally accepted definition of intelligence, a notion of rational agency has been proposed as an alternative for the characterization of intelligent agency. Modeling the epistemic state of a rational agen ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
agent is one of the most difficult tasks to be addressed in the design process, and its complexity is directly related to the formalism used for representing the knowledge of the agent. This paper presents the main features of Observation-based Defeasible Logic Programming (ODeLP), a formalism tailored
Towards a Formal and Implemented Model of Argumentation Schemes In . . .
- FIRST INTERNATIONAL WORKSHOP ON ARGUMENTATION IN MULTI-AGENT SYSTEMS
, 2004
"... Argumentation schemes are patterns of non-deductive reasoning that have long been studied in argumentation theory, and have more recently been identified in computational domains including multi-agent systems as holding the potential for significant improvements in reasoning and communication ab ..."
Abstract
-
Cited by 29 (10 self)
- Add to MetaCart
abilities. By focusing on models of natural language argumentation schemes, and then building formal systems from them, direct implementation becomes possible that not only has advantages in flexibility and scope, but also computational efficiency.
A Dialectical Model of Assessing Conflicting Arguments in Legal Reasoning
- Artificial Intelligence and Law
, 1996
"... . Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible argumentat ..."
Abstract
-
Cited by 143 (18 self)
- Add to MetaCart
. Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible
Results 1 - 10
of
1,547