1151 search results - page 60 / 231 » Collaborative Programming: Applications of Logic and Automat... |
121
Voted
NMR
2004
Springer
15 years 8 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
117
click to vote
KR
1994
Springer
15 years 7 months ago
1994
Springer
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
130
Voted
NMR
2004
Springer
15 years 8 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
132
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Building upon the 2-valued Layered Models semantics for normal programs, we introduce a refinement — the Layer Supported Models semantics — which, besides keeping all of LMs...