Sciweavers

2024 search results - page 215 / 405
» A Formal Model of Multi-agent Computations
Sort
View
CP
2006
Springer
15 years 8 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
AGI
2008
15 years 5 months ago
Comirit: Commonsense Reasoning by Integrating Simulation and Logic
Rich computer simulations or quantitative models can enable an agent to realistically predict real-world behavior with precision and performance that is difficult to emulate in log...
Benjamin Johnston, Mary-Anne Williams
CAISE
2004
Springer
15 years 8 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
IEEEHPCS
2010
15 years 2 months ago
Semantic model checking security requirements for web services
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
L. Boaro, E. Glorio, Francesco Pagliarecci, Luca S...
CAV
2005
Springer
129views Hardware» more  CAV 2005»
15 years 10 months ago
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vard...