Sciweavers

268 search results - page 12 / 54
» Equivalence for the G3'-stable models semantics
Sort
View
EKAW
2004
Springer
14 years 1 months ago
Extending Semantic-Based Matchmaking via Concept Abduction and Contraction
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
ICLP
2007
Springer
14 years 1 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...
TCBB
2011
13 years 2 months ago
Semantics and Ambiguity of Stochastic RNA Family Models
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...
Robert Giegerich, Christian Höner zu Siederdi...
SEFM
2008
IEEE
14 years 2 months ago
Restricted Broadcast Process Theory
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
AAAI
2008
13 years 10 months ago
Hyperequivalence of Logic Programs with Respect to Supported Models
Recent research in nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the st...
Miroslaw Truszczynski, Stefan Woltran