571 search results - page 43 / 115 » Domain Theory in Logical Form |
109
click to vote
AGP
2010
IEEE
15 years 2 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
AAAI
2004
14 years 11 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
INFORMS
1998
14 years 9 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
104
click to vote
IFSA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The paper develops fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form A ⇒ B where A and B are fuzzy sets of attributes. A formula A ⇒ B repr...
FSEN
2007
Springer
15 years 3 months ago
2007
Springer
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...