725 search results - page 46 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
134
Voted
IJCAI
1989
15 years 3 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
139
Voted
PADL
2005
Springer
15 years 8 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
129
click to vote
SAC
1994
ACM
15 years 6 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
97
Voted
ENTCS
2008
15 years 2 months ago
2008
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
170
Voted
KR
1991
Springer
15 years 6 months ago
1991
Springer
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...