Sciweavers

1117 search results - page 11 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
NMR
2004
Springer
14 years 1 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 10 days ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
ICALP
2000
Springer
14 years 5 days ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
AMAI
2004
Springer
13 years 8 months ago
Extending Answer Sets for Logic Programming Agents
We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents...
Marina De Vos, Dirk Vermeir
POPL
2004
ACM
14 years 9 months ago
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore