AI
2011
Springer
13 years 2 days ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
IWFM
1998
13 years 6 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
IJCAI
2007
13 years 6 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
CP
2005
Springer
13 years 7 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
KR
2010
Springer
13 years 7 months ago
2010
Springer
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
AI
2001
Springer
13 years 8 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
DOOD
1997
Springer
13 years 9 months ago
1997
Springer
With the increasing importance of the World Wide Web as an information source, there is a growing interest for integration of Web and database technology. Several Web query languag...
AMAST
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...