Sciweavers

158 search results - page 29 / 32
» Coinductive Logic Programming with Negation
Sort
View
166
Voted
IJFCS
2006
119views more  IJFCS 2006»
15 years 6 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
167
Voted
ADC
1999
Springer
97views Database» more  ADC 1999»
15 years 10 months ago
Pseudo-Naive Evaluation
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
Donald A. Smith, Mark Utting
206
Voted
CLIMA
2006
15 years 7 months ago
Adding Evolving Abilities to a Multi-Agent System
This paper reports on a fertile marriage between madAgents, a Java and Prolog based multi-agent platform, and EVOLP, a logic programming based language to represent and reason abou...
João Leite, Luís Soares
254
Voted
ICLP
2009
Springer
16 years 7 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
183
Voted
EPIA
2007
Springer
16 years 16 days ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...