In a previous work we have defined Monotonic logic Programs which extend definite logicprogramming to arbitrary complete lattices of truth-values with an appropriate notion of implication. We have shown elsewhere tha...
详细信息
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued ...
详细信息
there are many problems withthe simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding ...
详细信息
the proceedings contain 36 papers. the special focus in this conference is on Applications of artificialintelligence in Industry, artificialintelligence in Electronic Commerce, Intelligent Information Agents and Tea...
ISBN:
(纸本)3540425977
the proceedings contain 36 papers. the special focus in this conference is on Applications of artificialintelligence in Industry, artificialintelligence in Electronic Commerce, Intelligent Information Agents and Teamwork and Adjustable Autonomy in Agents. the topics include: artificialintelligence in industry;applying behavior-oriented robotics to a mobile security device;ontology design and its application in the petroleum remediation domain;a sales agent for website personalization;anomaly detection of computer usage using artificialintelligence techniques;application of self-organizing maps to classification and browsing of FAQ E-mails;classification based upon frequent patterns;an evolutionary approach to constraint-based timetabling;using XML as a language interface for AI applications;using boosting to detect noisy data;artificialintelligence in electronic commerce;conceptual structures for tendering ontology;agent based architecture for internet marketing;possibilistic reasoning for intelligent payment agents;a web-based negotiation agent using CBR;intelligent information agents;relationships between logicprogramming and RDF;an approach to building mobile intelligent agents based on anytime migration;knowledge-based information agents;designing perception modules to shape information for agents;design of a visulization agent for WWW information;revisable analysis and design by actors interaction;a logic-based approach for adaptive information filtering agents;an approach for service and profile management in wireless access systems;system analysis of agent-based LCC information gathering;teamwork and adjustable autonomy in agents;a communication protocol supporting dynamic autonomy agreements in multi-agent systems;designing human-centered autonomous agents and dimensions of adjustable autonomy.
We investigate in this paper the relationship between an ambiguity propagating defeasible logic recently proposed by Antoniou et al. [3] and well-founded semantics with priorities [6] under a straightforward translati...
详细信息
When Prolog programs that manipulate lists to manage a collection of resources are rewritten to take advantage of the linear logic resource management provided by the logicprogramming language Lolli, they can obtain ...
详细信息
According to Dynamic logicprogramming (DLP), knowl-edge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. these may represent time (e.g. in updates), speci...
详细信息
We present a method to learn simultaneously definitions for a concept and its negation. this problem is relevant when we have to deal with a complex domain where it is difficult to acquire a complete theory and where ...
详细信息
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 ...
详细信息
A binary resolution proof is representedby a binary resolution tree (brt) with clauses at the nodes and resolutions being performed at the internal nodes. A rotation in a brt can be performed on two adjacent internal ...
详细信息
ISBN:
(纸本)9783540429579
A binary resolution proof is representedby a binary resolution tree (brt) with clauses at the nodes and resolutions being performed at the internal nodes. A rotation in a brt can be performed on two adjacent internal nodes if the result of reversing the order of the resolutions does not affect the clause recorded at the node closer to the root. Two brts are saidto be rotationally equivalent if one can be obtainedfrom the other by a sequence of rotations. Let c(T) be the number of brts rotationally equivalent to T. It is shown that if T has n resolutions, all on distinct atoms, and m merges or factors between literals, then (T) ≥ 22n-ΘT(m log(n/m)) Moreover c(T) can be as large as n!/(m + 1). A-ordering, lock resolution and the rank/activity restriction avoidcalculating equivalent brts. A dynamic programming polynomial-time algorithm is also given to calculate c(T) if T has no merges or factors.
暂无评论