Sciweavers

1020 search results - page 42 / 204
» Tight Semantics for Logic Programs
Sort
View
JAPLL
2007
135views more  JAPLL 2007»
13 years 8 months ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
LPNMR
2007
Springer
14 years 2 months ago
An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible Logic ...
Edgardo Ferretti, Marcelo Errecalde, Alejandro Jav...
LPNMR
1999
Springer
14 years 1 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
ECOWS
2006
Springer
14 years 14 days ago
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...
Frank Kaufer, Matthias Klusch
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
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...
Magnus O. Myreen, Scott Owens