Sciweavers

1341 search results - page 203 / 269
» Logic for Modeling Product Structure
Sort
View
APN
2004
Springer
15 years 9 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
FSTTCS
2004
Springer
15 years 9 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
ECAI
2006
Springer
15 years 7 months ago
Background Default Knowledge and Causality Ascriptions
A model is defined that predicts an agent's ascriptions of causality (and related notions of facilitation and justification) between two events in a chain, based on background...
Jean-François Bonnefon, Rui Da Silva Neves,...
MMNS
2004
89views Multimedia» more  MMNS 2004»
15 years 5 months ago
Automated Validation of Service Configuration on Network Devices
Due to the significant development of network services in the past few years, their validation has become increasingly difficult. The advent of novel approaches to the issue of val...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...
AAAI
1994
15 years 5 months ago
Formalizing Ontological Commitment
Formalizing the ontological commitment of a logical language means offering a way to specify the intended meaning of its vocabulary by constraining the set of its models, giving e...
Nicola Guarino, Massimiliano Carrara, Pierdaniele ...