Sciweavers

5378 search results - page 79 / 1076
» Base Logics in Argumentation
Sort
View
LPNMR
2009
Springer
16 years 13 days ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
ML
2008
ACM
100views Machine Learning» more  ML 2008»
15 years 5 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
CADE
2006
Springer
16 years 6 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
BSL
2010
15 years 3 months ago
The senses of functions in the Logic of Sense and Denotation
This paper discusses certain problems arising within the treatment of the senses of functions in Alonzo Church's Logic of Sense and Denotation. Church understands such senses ...
Kevin C. Klement
ICCSA
2004
Springer
15 years 11 months ago
A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
Juan Frausto Solís, Marco Antonio Cruz-Chav...