Sciweavers

276 search results - page 15 / 56
» Representing Transition Systems by Logic Programs
Sort
View
AAAI
1996
13 years 9 months ago
Learning to Parse Database Queries Using Inductive Logic Programming
This paper presents recent work using the Chill parser acquisition system to automate the construction of a natural-language interface for database queries. Chill treats parser ac...
John M. Zelle, Raymond J. Mooney
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
13 years 11 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
LPNMR
2009
Springer
14 years 2 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 1 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ICLP
2010
Springer
13 years 11 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift