528 search results - page 39 / 106 » Transition Logic Revisited |
152
click to vote
IFIP
2010
Springer
14 years 8 months ago
2010
Springer
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
83
Voted
LOGCOM
2007
15 years 1 months ago
2007
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
117
click to vote
CADE
1998
Springer
15 years 6 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
137
click to vote
AAAI
2000
15 years 3 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
129
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...