Sciweavers

1950 search results - page 73 / 390
» Lambda-Free Logical Frameworks
Sort
View
KR
2010
Springer
15 years 11 months ago
Modelling Combinatorial Auctions in Linear Logic
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
Daniele Porello, Ulle Endriss
INAP
2001
Springer
15 years 10 months ago
ISCO: A Practical Language for Logic-Based Construction of Heterogeneous Information Systems
Universidade de ´Evora’s Integrated Information System (SIIUE) aims at representing the entire universe of concepts useful for the management and day-to-day operation of the Or...
Salvador Abreu
ECSQARU
2005
Springer
15 years 12 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
BIRTHDAY
2003
Springer
15 years 11 months ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 11 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean