387 search results - page 13 / 78 » Hyperequivalence of Logic Programs with Respect to Supported... |
ARGMAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this work, an agent architecture that combines defeasible argumentation and the BDI model is described. Argumentation will be used as a mechanism for reasoning about b...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The rapid expansion of the Internet and World Wide Web led to growing interest in data and information integration, which should be capable to deal with inconsistent and ...
LPNMR
1999
Springer
13 years 12 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...