2291 search results - page 135 / 459 » Logic Programming and Model Checking |
146
Voted
AAAI
2006
15 years 4 months ago
2006
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
164
Voted
DLT
2009
15 years 10 days ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
129
Voted
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
128
click to vote
FUIN
2010
14 years 12 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
115
click to vote
USS
2008
15 years 4 months ago
2008
Cross-site scripting (XSS) and SQL injection errors are two prominent examples of taint-based vulnerabilities that have been responsible for a large number of security breaches in...