Sciweavers

275 search results - page 12 / 55
» Non-Termination Inference of Logic Programs
Sort
View
POPL
2002
ACM
15 years 10 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
LPAR
2005
Springer
15 years 3 months ago
Programming Cognitive Agents in Defeasible Logic
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...
Mehdi Dastani, Guido Governatori, Antonino Rotolo,...
IJFCS
2000
71views more  IJFCS 2000»
14 years 9 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
APAL
2005
135views more  APAL 2005»
14 years 9 months ago
Safe beliefs for propositional theories
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...
Mauricio Osorio, Juan Antonio Navarro Pérez...
FROCOS
2009
Springer
15 years 2 months ago
A Declarative Agent Programming Language Based on Action Theories
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between ...
Conrad Drescher, Stephan Schiffel, Michael Thielsc...