Sciweavers

3926 search results - page 702 / 786
» A Logic of Object-Oriented Programs
Sort
View
SYNTHESE
2011
239views more  SYNTHESE 2011»
14 years 12 months ago
Carnap on theoretical terms: structuralism without metaphysics
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
Michael Friedman
CADE
2011
Springer
14 years 5 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
ICML
2004
IEEE
16 years 5 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
CADE
2007
Springer
16 years 5 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
138
Voted
CPAIOR
2009
Springer
15 years 11 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin