148 search results - page 20 / 30 » apal 2007 |
107
click to vote
APAL
2005
15 years 13 days ago
2005
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
APAL
2005
15 years 13 days ago
2005
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
109
Voted
APAL
2004
15 years 12 days ago
2004
Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The concept of integrality arose naturally early in the history of the subject, and s...
110
Voted
APAL
2002
15 years 12 days ago
2002
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
94
Voted
APAL
2000
15 years 11 days ago
2000
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...