Sciweavers

5482 search results - page 71 / 1097
» Logic Programming and Databases
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 9 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
EPIA
1995
Springer
15 years 1 months ago
A Model Theory for Paraconsistent Logic Programming
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
Carlos Viegas Damásio, Luís Moniz Pe...
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 4 months ago
Representing First-Order Causal Theories by Logic Programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definit...
Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vlad...
IFIP
1998
Springer
15 years 2 months ago
Scheduling in a Multi-Agent Environment
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...
M. Schmotzer, Jan Paralic, Julius Csontó
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin