318 search results - page 26 / 64 » Temporal Disjunctive Logic Programming |
LPKR
1997
Springer
14 years 5 days ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
AI
2010
Springer
13 years 8 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
ICLP
2010
Springer
13 years 12 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...
AMAI
2006
Springer
13 years 8 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
KBSE
2003
IEEE
14 years 1 months ago
2003
IEEE
Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...