4513 search results - page 313 / 903 » Logic programming with satisfiability |
218
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
201
click to vote
APIN
1998
15 years 6 months ago
1998
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
272
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
188
click to vote
LPNMR
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
177
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...