3572 search results - page 80 / 715 » Nominal Logic Programming |
131
click to vote
ICFP
2012
ACM
13 years 3 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
CADE
2008
Springer
16 years 26 days ago
2008
Springer
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming lan...
104
Voted
LOPSTR
1994
Springer
15 years 4 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...
113
Voted
LICS
1994
IEEE
15 years 4 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 ...
126
click to vote
ASP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...