Sciweavers

1667 search results - page 11 / 334
» Extended clause learning
Sort
View
TOCL
2008
102views more  TOCL 2008»
13 years 7 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
IJCAI
1989
13 years 8 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
ICTAI
2009
IEEE
14 years 2 months ago
Learning for Dynamic Subsumption
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
Youssef Hamadi, Saïd Jabbour, Lakhdar Sais
ILP
2003
Springer
14 years 25 days ago
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
Oliver Ray, Krysia Broda, Alessandra Russo
ECAI
2004
Springer
14 years 1 months ago
Extending Defeasible Logic and Defeasible Prolog
Abstract. Defeasible logic (DL) promotes enthymemic, argumentative reasoning on incomplete set of premisses retracted on the presence of contrary information. Defeasible Prolog (d-...
Ahti-Veikko Pietarinen