Peter Schüller

ORCID: 0000-0002-1837-126X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Logic, Reasoning, and Knowledge
  • Multi-Agent Systems and Negotiation
  • Semantic Web and Ontologies
  • Logic, programming, and type systems
  • Stellar, planetary, and galactic studies
  • AI-based Problem Solving and Planning
  • Adaptive optics and wavefront sensing
  • Natural Language Processing Techniques
  • Topic Modeling
  • Astronomy and Astrophysical Research
  • Time Series Analysis and Forecasting
  • Anomaly Detection Techniques and Applications
  • Bayesian Modeling and Causal Inference
  • Advanced Measurement and Metrology Techniques
  • Fault Detection and Control Systems
  • Formal Methods in Verification
  • Advanced Fiber Optic Sensors
  • Astro and Planetary Science
  • Astrophysics and Star Formation Studies
  • Radio Astronomy Observations and Technology
  • Optical Polarization and Ellipsometry
  • Sentiment Analysis and Opinion Mining
  • Biomedical Text Mining and Ontologies
  • IoT and Edge/Fog Computing
  • Astronomical Observations and Instrumentation

TU Wien
2012-2022

Marmara University
2014-2020

Sabancı Üniversitesi
2013-2014

Institut d'Astrophysique Spatiale
2008-2011

University of Calabar
2011

Laboratoire d’études spatiales et d’instrumentation en astrophysique
2011

Université Paris-Sud
2008-2010

Centre National de la Recherche Scientifique
2010

Smithsonian Astrophysical Observatory
2006

Swedish Museum of Natural History
2005

Pathfinding for a single agent is the problem of planning route from an initial location to goal in environment, going around obstacles. multiple agents also aims plan such routes each agent, subject different constraints, as restrictions on length path or total paths, no self-intersecting intersection paths/plans, crossing/meeting other. It has variations finding optimal solutions, e.g., with respect maximum length, sum lengths. These problems are important many real-life applications,...

10.1609/aaai.v27i1.8592 article EN Proceedings of the AAAI Conference on Artificial Intelligence 2013-06-30

10.1016/j.artint.2014.07.008 article EN publisher-specific-oa Artificial Intelligence 2014-07-29

Abstract As software systems are getting increasingly connected, there is a need for equipping nonmonotonic logic programs with access to external sources that possibly remote and may contain information in heterogeneous formats. To cater this need, hex were designed as generalization of answer set an API style interface allows arbitrary sources, providing great flexibility. Efficient evaluation such however challenging, it requires interleave computation model building; decide when switch...

10.1017/s1471068415000113 article EN Theory and Practice of Logic Programming 2015-08-13

We provide a systematic analysis of levels integration between discrete high-level reasoning and continuous low-level feasibility checks to address hybrid planning problems in robotic applications. identify four distinct strategies for such an integration: (i) are done al l possible cases advance the results used during plan generation; (ii) exactly when they needed search plan; (iii) after is computed, if found infeasible then new computed; (iv) similar previous strategy but computation...

10.3233/aic-150697 article EN AI Communications 2016-03-02

The mid-infrared interferometric instrument MIDI is currently undergoing testing in preparation for commissioning on the Very Large Telescope Interferometer VLTI at end of this year 2002. It will perform observations over 8 μm - 13 wavelength range, with a spatial resolution 20 milliarcsec, spectral up to 250, and an anticipated point source sensitivity N = 4 mag or 1 Jy self-fringe tracking, which be only observing mode during first months operation. We describe layout performance...

10.1117/12.457027 article EN Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2003-02-24

HEX-programs extend logic programs under the answer set semantics with external computations through atoms. As reasoning from ground Horn nonmonotonic atoms of polynomial complexity is already on second level hierarchy, minimality checking candidates needs special attention. To this end, we present an approach based unfounded sets as a generalization related techniques for ASP programs. The detection expressed propositional SAT problem, which provide two different encodings and optimizations...

10.1613/jair.4175 article EN publisher-specific-oa Journal of Artificial Intelligence Research 2014-02-26

Abstract We study the problem of finding optimal plans for multiple teams robots through a mediator, where each team is given task to complete in its workspace on own and are allowed transfer between other, subject following constraints: 1) (and mediator) do not know about other's or tasks (e.g., privacy purposes); 2) every can lend borrow robots, but both transportation/calibration between/for different workspaces usually costly). present mathematical definition this analyze computational...

10.1017/s1471068413000525 article EN Theory and Practice of Logic Programming 2013-07-01

Abstract Answer set programming (ASP) is a well-established declarative paradigm. One of the successes ASP availability efficient systems. State-of-the-art systems are based on ground+solve approach. In some applications, this approach infeasible because grounding one or few constraints expensive. paper, we systematically compare alternative strategies to avoid instantiation problematic constraints, which custom extensions solver. Results real and synthetic benchmarks highlight strengths...

10.1017/s1471068417000254 article EN Theory and Practice of Logic Programming 2017-08-24

We study abduction in First Order Horn logic theories where all atoms can be abduced and we are looking for preferred solutions with respect to three objective functions: cardinality minimality, coherence, weighted abduction. represent this reasoning problem Answer Set Programming (ASP), order obtain a flexible framework experimenting global constraints functions, test the boundaries of what is possible ASP. Realizing ASP challenging as it requires value invention equivalence between certain...

10.3233/fi-2016-1446 article EN Fundamenta Informaticae 2016-12-24

Answer Set Programming (ASP) is a well-known formalism for Knowledge Representation and Reasoning, successfully employed to solve many AI problems, also thanks the availability of efficient implementations. Traditionally, ASP systems are based on ground&solve approach, where grounding transforms general input program into its propositional counterpart, whose stable models then computed by solver using CDCL algorithm. This approach suffers an intrinsic limitation: one or few constraints...

10.24963/ijcai.2020/234 article EN 2020-07-01

We present a brief review of recent scientific and technical advances at the Infrared Optical Telescope Array (IOTA). IOTA is long-baseline interferometer located atop Mount Hopkins, Arizona. Recent work has emphasized use three-telescope completed in 2002. report on results obtained range targets, including AGB stars, Herbig AeBe Stars, binary outburst recurrent nova RS Oph. completion new spectrometer which allows visibility measurements several high spectral resolution channels...

10.1117/12.672597 article EN Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2006-06-14
Coming Soon ...