Sciweavers

65 search results - page 10 / 13
» Nonmonotonic Reasoning, Preferential Models and Cumulative L...
Sort
View
ECSQARU
2009
Springer
15 years 4 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
ESWS
2008
Springer
14 years 11 months ago
An Ontology for Software Models and Its Practical Implications for Semantic Web Reasoning
Ontology-Driven Software Development (ODSD) advocates using ontologies for capturing knowledge about a software system at development time. So far, ODSD approaches have mainly focu...
Matthias Bräuer, Henrik Lochmann
AAAI
2000
14 years 10 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
JOLLI
2002
109views more  JOLLI 2002»
14 years 9 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
ICLP
2003
Springer
15 years 2 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink