Asperti, A., A logic for concurrency, Technical report, Computer Science Department, University of Pisa (1987). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Logical Aspects of Argument-based Negotiation among.. - Brito, Novais, Neves (2001) (Correct)
.... itself, as previously stated, in logic and, particularly, in logic programming (incorporating important concepts such as nonmonotonicity) Taking into account the Closed World Assumption (CWA) i.e. what is not stated as true must be false) the concept of negation as failure may be introduced [1]. De nition 1. negation as failure) The formula not P i , with P i being a literal (i.e. a formula with the form p or :p, where p is an atom) represents the negation as failure; i.e. it means that it is not possible to prove that P i is true. A language is established in order to express the ....
Baral, C., Gelfond, M., Logic Programming and Knowledge Representation, Research Report, Computer Science Department, University of Texas at El Paso, El Paso, Texas, 1994.
Temporality, Priorities and Delegation in an E-Commerce.. - Brito, Novais, Neves (2001) (Correct)
....methods 1 Introduction The amount of ambiguity present in real life negotiations is intolerable for automatic reasoning systems. Formalizing the process that opposes, during negotiation, intelligent agents is, therefore, extremely important. Logic, and especially, Extend Logic Programming (ELP) [Baral et al., 1994] poses itself as a powerful tool to achieve both the desired formality without compromising comprehension readability, and the ability to easily build an executable prototype. Logical formulas are extremely powerful, unambiguous and possess a set of interesting advantages [McCarthy, 1959] ....
....it is now possible to assert the conditions under which a given product or service may be traded. The situation where the ability to trade product P with agent Y is known, but the trading conditions are not defined, may be overcomed with the use of a null value from an unknown set of values [Baral et al., 1994]. 4 Definition 3 (Unknown Conditions taken from an Unknown Set of Values) An unknown conditions situation arises when an agent can not express in its KB the right to deal with a given counter part, using a set of conditions (taken from an unknown set of possible values) Taking predicates ....
Baral, C., Gelfond, M., Logic Programming and Knowledge Representation, Research Report, Computer Science Department, University of Texas at El Paso, El Paso, Texas, 1994.
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004) (3 citations) Self-citation (Report) (Correct)
No context found.
A. Asperti. A logic for concurrency. Technical report, Computer Science Department, University of Pisa, 1987.
AKL(FD) - A concurrent language for FD programming - Carlson, Haridi, Janson Self-citation (Fd) (Correct)
No context found.
Logic Programming over Finite Domains: the Design, Implementation, and Applications of cc#fd#. Technical report, Computer Science Department, Brown University, 1992.
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
No context found.
Asperti, A., A logic for concurrency, Technical report, Computer Science Department, University of Pisa (1987).
Developing Agents for Electronic Commerce - Constructive Approach Paulo (2001) (Correct)
No context found.
Baral, C., Gelfond, M., Logic Programming and Knowledge Representation, Research Report, Computer Science Department, University of Texas at El Paso, El Paso, Texas, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC