3738 search results - page 552 / 748 » Parametrized Logic Programming |
112
click to vote
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
102
Voted
ITC
1999
IEEE
15 years 4 months ago
1999
IEEE
A new synthesis technique for designing finite state machines with on-line parity checking is presented. The output logic and the next-state logic of the finite state machines are...
139
Voted
FLOPS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
75
Voted
KR
2000
Springer
15 years 4 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
100
click to vote
ECAIW
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...