5506 search results - page 291 / 1102 » Minimal Logic Programs |
108
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
130
Voted
ICLP
1999
Springer
15 years 9 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
133
click to vote
INFORMATICALT
2000
15 years 4 months ago
2000
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
138
Voted
GCB
1997
Springer
15 years 8 months ago
1997
Springer
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
144
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...