Sciweavers

1320 search results - page 75 / 264
» Efficient Implementation of a Linear Logic Programming Langu...
Sort
View
ILP
2000
Springer
15 years 7 months ago
Bayesian Logic Programs
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
Kristian Kersting, Luc De Raedt
ICFP
2010
ACM
15 years 4 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
ICLP
2009
Springer
16 years 4 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
SAC
2006
ACM
15 years 10 months ago
Union types for object-oriented programming
We propose union types for statically typed class-based objectoriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be con...
Atsushi Igarashi, Hideshi Nagira
IFIP
2004
Springer
15 years 9 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham