4513 search results - page 112 / 903 » Logic programming with satisfiability |
124
Voted
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming lan...
130
click to vote
LOPSTR
1994
Springer
15 years 7 months ago
1994
Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
141
click to vote
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
168
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
146
click to vote
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...