Sciweavers

4126 search results - page 324 / 826
» Set based logic programming
Sort
View
CORR
2000
Springer
103views Education» more  CORR 2000»
15 years 4 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
ATAL
2007
Springer
15 years 11 months ago
The LOGIC negotiation model
Successful negotiators prepare by determining their position along five dimensions: Legitimacy, Options, Goals, Independence, and Commitment, (LOGIC). We introduce a negotiation ...
Carles Sierra, John K. Debenham
TABLEAUX
2007
Springer
15 years 11 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
ENTCS
2006
142views more  ENTCS 2006»
15 years 5 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind
FSS
2006
85views more  FSS 2006»
15 years 5 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...