BibSLEIGH — Marc

Travelled to:

1 × Australia
1 × Austria
1 × Belgium
1 × China
1 × Cyprus
1 × Hungary
1 × Japan
1 × Latvia
1 × Portugal
1 × Spain
1 × United Kingdom
2 × Canada
2 × France
2 × Germany
4 × Italy
4 × USA

Collaborated with:

M.Bruynooghe J.Vennekens D.D.Schreye ∅ K.V.Belleghem J.Wittocx B.d.Cat M.Truszczynski H.Vlaeminck M.Mariën V.W.Marek D.Boulanger E.Ternovska A.Cortés-Calabuig O.Arieli P.J.Stuckey P.Hou D.Gilis N.Pelov S.Verbaeten B.Bogaerts I.Dasseville M.v.d.Hallen G.Janssens Y.Lierler H.Vandecasteele D.A.d.Waal B.V.Nuffelen G.Duchatelet F.Piessens B.Demoen A.Mulkers J.Jansen H.Blockeel S.D.Pooter A.Labarre J.Ramon S.Verwer

Talks about:

logic (19) program (10) semant (7) calculus (6) knowledg (5) definit (5) model (5) system (4) induct (4) abduct (4)

Person: Marc Denecker

DBLP: Denecker:Marc

Contributed to:

2015

2014

2012

2010

2009

2008

2006

2004

2002

2001

2000

1998

1997

1996

1995

1994

1993

1992

Wrote 34 papers:

ICLP-J-2015-DassevilleHJD #composition #framework #logic #semantics: Semantics of templates in a compositional framework for building logics (ID, MvdH, GJ, MD), pp. 681–695.
ICLP-J-2014-BogaertsJBCVD #calculus #linear #simulation #using: Simulating Dynamic Systems Using Linear Time Calculus Theories (BB, JJ, MB, BdC, JV, MD), pp. 477–492.
KR-2014-DeneckerV #induction #principle #revisited #semantics: The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited (MD, JV).
ICLP-2012-BlockeelBBCP #data mining #machine learning #mining #modelling #problem: Modeling Machine Learning and Data Mining Problems with FO(·) (HB, BB, MB, BdC, SDP, MD, AL, JR, SV), pp. 14–25.
ICLP-2012-CatDS #incremental #lazy evaluation: Lazy Model Expansion by Incremental Grounding (BdC, MD, PJS), pp. 201–211.
ICLP-2012-DeneckerLTV #programming #semantics #set: A Tarskian Informal Semantics for Answer Set Programming (MD, YL, MT, JV), pp. 277–289.
KR-2012-VlaeminckVBD #complexity #logic #order #semantics: Ordered Epistemic Logic: Semantics, Complexity and Applications (HV, JV, MB, MD).
ICLP-J-2010-HouCD #fixpoint #logic #rule-based: FO(FD): Extending classical logic with rule-based fixpoint definitions (PH, BdC, MD), pp. 581–596.
ICLP-2009-Denecker #knowledge base: A Knowledge Base System Project for FO(.) (MD), p. 22.
ICLP-2009-WittocxVD #debugging: Debugging for Model Expansion (JW, HV, MD), pp. 296–311.
PPDP-2009-VlaeminckVD #framework #logic: A logical framework for configuration software (HV, JV, MD), pp. 141–148.
ICLP-2008-DeneckerV #integration #knowledge base #logic programming: Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic (MD, JV), pp. 71–76.
KR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #performance #query: Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
KR-2008-WittocxMD #approximate #first-order #logic #reasoning: Approximate Reasoning in First-Order Logic Theories (JW, MM, MD), pp. 103–112.
SAT-2008-MarienWDB #induction #logic #satisfiability: SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
ICLP-2006-WittocxVMDB #semantics: Predicate Introduction Under Stable and Well-Founded Semantics (JW, JV, MM, MD, MB), pp. 242–256.
CAiSE-2004-NuffelenCDAB #integration #using: Data Integration Using ID-Logic (BVN, ACC, MD, OA, MB), pp. 67–81.
ICLP-2004-VennekensGD: Splitting an Operator (JV, DG, MD), pp. 195–209.
KR-2004-Denecker #analysis #logic programming #what: What’s in a Model? Epistemological Analysis of Logic Programming (MD), pp. 106–113.
KR-2004-DeneckerT #calculus #induction: Inductive Situation Calculus (MD, ET), pp. 545–553.
KR-2002-DeneckerMT #approximate #information management #representation: Ultimate Approximations in Nonmonotonic Knowledge Representation Systems (MD, VWM, MT), pp. 177–190.
ICLP-2001-DeneckerPB #logic programming #semantics #source code: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates (MD, NP, MB), pp. 212–226.
CL-2000-Denecker #induction #logic: Extending Classical Logic with Inductive Definitions (MD), pp. 703–717.
KR-2000-DeneckerMT #logic #semantics: Uniform semantic treatment of default and autoepistemic logic (MD, VWM, MT), pp. 74–84.
ALP-PLILP-1998-BruynoogheVWD #detection #logic programming #query #source code: Detecting Unsolvable Queries for Definite Logic Programs (MB, HV, DAdW, MD), pp. 118–133.
ICLP-1997-BelleghemDS #logic #logic programming: A Strong Correspondence between Description Logics and Open Logic Programming (KVB, MD, DDS), pp. 346–360.
ILPS-1997-VerbaetenDS #composition #logic programming #source code: Compositionality of Normal Open Logic Programs (SV, MD, DDS), pp. 371–385.
JICSLP-1996-DeneckerBDPS #calculus #empirical #information management #protocol #representation #specification: A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification (MD, KVB, GD, FP, DDS), pp. 170–184.
SAS-1996-BruynoogheDBDM #analysis #logic programming #source code: A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation (MB, BD, DB, MD, AM), pp. 128–142.
ICLP-1995-BelleghemDS #calculus: Combining Situation Calculus and Event Calculus (KVB, MD, DDS), pp. 83–97.
ICLP-1994-BelleghemDS #abduction #calculus #representation: Representing Continuous Change in the Abductive Event Calculus (KVB, MD, DDS), pp. 225–239.
PLILP-1994-BoulangerBD #approach #using: Abstracting s-semantincs Using A Model-Theoretic Approach (DB, MB, MD), pp. 432–446.
ILPS-1993-DeneckerS #abduction #information management #logic programming #representation: Representing Incomplete Knowledge in Abductive Logic Programming (MD, DDS), pp. 147–163.
JICSLP-1992-DeneckerS #abduction #named #source code: SLDNFA: An Abductive Procedure for Normal Abductive Programs (MD, DDS), pp. 686–700.