71 search results - page 9 / 15 » Decidability Under the Well-Founded Semantics |
ECCC
2007
13 years 7 months ago
2007
Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
ISMVL
2010
IEEE
13 years 11 months ago
2010
IEEE
Non-deterministic multi-valued matrices (Nmatrices) are a new, fruitful and quickly expanding field of research first introduced a few years ago. Since then it has been rapidly ...
TII
2008
13 years 7 months ago
2008
Abstract--Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however power...