Sciweavers

222 search results - page 34 / 45
» Prioritizing Default Logic
Sort
View
JOLLI
2002
109views more  JOLLI 2002»
14 years 11 months ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur
EPIA
2005
Springer
15 years 5 months ago
Revised Stable Models - A Semantics for Logic Programs
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
Luís Moniz Pereira, Alexandre Miguel Pinto
LPNMR
2001
Springer
15 years 4 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
ICLP
2009
Springer
16 years 12 days ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
AGP
2003
IEEE
15 years 5 months ago
An Evolving Agent with EVOLP
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. Evolving Logic Programs (EVOLP) has been recent...
José Júlio Alferes, Antonio Brogi, J...